#include<iostream>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 using namespace std;

 const int MAXN = 2e6 + ;

 int a[MAXN], cnt_ne = , cnt_po = , d[MAXN];

 int ne[MAXN], po[MAXN];

 long long sum = ;

 int main()

 {

     int n;

     scanf("%d", &n);

     memset(ne, , sizeof(ne));

     memset(po, , sizeof(po));

     for (int i = ;i<n;i++) {

         scanf("%d", &a[i]);

         d[i] = a[i] - i-;

         if (d[i]>) {

             cnt_po++;

             po[d[i]]++;

         }

         else {

             cnt_ne++;

             ne[-d[i]]++;

         }

         sum += abs(d[i]);

     }

     int u = ;

     long long res = sum;

     for (int i = ;i<n;i++) {

         //cout << sum << endl;

         sum += cnt_ne;

         sum -= cnt_po;

         cnt_po -= po[i];

         cnt_ne += po[i];

         d[n - i] -= i - ;//最后一个数更新差值

                           //再放到第一位，进行判断

         if (d[n - i] <= ) {

             if (d[n - i] + n - >) {

                 int dd = d[n - i] + n -  - (abs(d[n - i])+);

                 d[n - i] += n - ;

                 sum += dd;

                 cnt_po++;

                 cnt_ne--;

                 po[d[n - i] + i]++;

             }

             else sum -= n;

         }else sum += n - ;

         if (res>sum) {

             res = sum;

             u = i;

         }

     }

     cout << res << ' ' << u << endl;

 }