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.
  assert move_one_ball([3, 4, 5, 1, 2])==True
  assert move_one_ball([3, 5, 10, 1, 2])==True
  assert move_one_ball([4, 3, 1, 2])==False
  assert move_one_ball([3, 5, 4, 1, 2])==False
  assert move_one_ball([])==True
output: def move_one_ball(lst):
      if not lst:
          return True
      n = len(lst)
      count = 0
      for i in range(n):
          if lst[i] > lst[(i + 1) % n]:
              count += 1
          if count > 1:
              return False
      return True