input: Write a function to determine if it is possible to get a list sorted in non-descending 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.
  
  assert can_be_sorted_with_shifts([3, 4, 5, 1, 2]) == True
  assert can_be_sorted_with_shifts([3, 5, 10, 1, 2]) == True
  assert can_be_sorted_with_shifts([4, 3, 1, 2]) == False
  assert can_be_sorted_with_shifts([3, 5, 4, 1, 2]) == False
  assert can_be_sorted_with_shifts([]) == True
output: def can_be_sorted_with_shifts(lst):
      if not lst:
          return True
      n = len(lst)
      count = 0
      for i in range(1, n):
          if lst[i] < lst[i - 1]:
              count += 1
      return count <= 1