input: Write a function that takes a list as input and determines if it is possible to rearrange the list into non-decreasing order by performing any number of right-shift operations on the elements of the list, and returns `True` if it is possible and `False` otherwise. If the input list is empty, the function should return `True`.
  assert rotate_right_sort([])==True
  assert rotate_right_sort([3, 4, 5, 1, 2])==True
  assert rotate_right_sort([4, 3, 1, 2])==False
  assert rotate_right_sort([1, 2, 3, 4, 5, 6])==True
  assert rotate_right_sort([3, 7, 2, 1])==False
output: def rotate_right_sort(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