easy python code
\nclass Solution:\n    def minimumRightShifts(self, nums: List[int]) -> int:\n        c=0\n        n=len(nums)\n        l=sorted(nums)\n        if nums==l:\n   
\nclass Solution:\n    def minimumRightShifts(self, nums: List[int]) -> int:\n        c=0\n        n=len(nums)\n        l=sorted(nums)\n        if nums==l:\n            return 0\n        for i in range(1,n):\n            if nums[-i:]+nums[:-i]==l:\n                return i\n        return -1\n```
['Python3']