input: Write a function to determine if a given list of integers can be rearranged into non-decreasing order by performing any number of right shift operations on the list. If it is possible, the function should return True; otherwise, it should return False. If the input list is empty, return True.
  assert move_to_non_decreasing_order([5, 9, 10, 7, 6]) == True
  assert move_to_non_decreasing_order([20, 30, 40, 11, 5]) == True
  assert move_to_non_decreasing_order([9, 2, 8, 4, 7]) == False
  assert move_to_non_decreasing_order([8, 3, 7, 5, 6]) == False
  assert move_to_non_decreasing_order([]) == True
output: def move_to_non_decreasing_order(nums):
      if not nums:
          return True
      n = len(nums)
      for i in range(n):
          if all(nums[(i + j) % n] <= nums[(i + j + 1) % n] for j in range(n)):
              return True
      return False