### Problem↵
You are give a permutation of length `n`. Among all rotations of this permutation find out the one with maximum number of `cycles`.<br>↵
`Cycles` here mean that cyles in the graph of permutation which contains edges from `element->corresponding index`. (One based indexing)<br>↵
#### Constraints:↵
`n <= 3e5`
You are give a permutation of length `n`. Among all rotations of this permutation find out the one with maximum number of `cycles`.<br>↵
`Cycles` here mean that cyles in the graph of permutation which contains edges from `element->corresponding index`. (One based indexing)<br>↵
#### Constraints:↵
`n <= 3e5`
