input: Write a function to determine if it is possible to get a list of integers sorted in non-decreasing order by performing any number of right shift operations on the given list. If it is possible return True else return False. If the given list is empty then return True.
  
  def can_be_sorted_by_shifts(lst):
      if not lst:
          return True
      rotations = lst[:]
      for _ in range(len(lst)):
          if all(rotations[i] <= rotations[i + 1] for i in range(len(rotations) - 1)):
              return True
          rotations = [rotations[-1]] + rotations[:-1]
      return False
  
  # Test cases
  assert can_be_sorted_by_shifts([3, 4, 5, 1, 2]) == True
  assert can_be_sorted_by_shifts([3, 5, 10, 1, 2]) == True
  assert can_be_sorted_by_shifts([4, 3, 1, 2]) == False
  assert can_be_sorted_by_shifts([3, 5, 4, 1, 2]) == False
  assert can_be_sorted_by_shifts([]) == True
output: def can_be_sorted_by_shifts(lst):
      if not lst:
          return True
      rotations = lst[:]
      for _ in range(len(lst)):
          if all(rotations[i] <= rotations[i + 1] for i in range(len(rotations) - 1)):
              return True
          rotations = [rotations[-1]] + rotations[:-1]
      return False