func_code_string: #include <bits/stdc++.h>   using namespace std;   int main() {     int n, c = 0;     cin >> n;     int r = n;     int arr[n];     deque<int> d;     for (int i = 0; i < n; i++) {       scanf( %d , &arr[i]);       d.push_back(arr[i]);     }     sort(arr, arr + n);     for (int i = 0; i < n; i++) {       if (d[i] == arr[i]) {         c++;       }     }     int mid = (n + 1) / 2 - 1;     if (c == n) {       printf( %d n , 0);       ;       return 0;     } else {       c = 0;       while (r--) {         int t = 0;         d.push_front(d.back());         d.pop_back();         c++;         if (arr[0] == d.front() && arr[n - 1] == d.back() && arr[mid] == d[mid]) {           if (mid + 1 < n) {             if (d[mid + 1] >= d[mid] && d[mid - 1] <= d[mid]) {               printf( %d n , c);               ;               return 0;             }           } else {             printf( %d n , c);             ;             return 0;           }         }       }     }     printf( %d n , -1);     ;     return 0;   }   