4
1 2 4 3
 4
2 1 4 3
 10
1 2 10 9 7 4 8 3 6 5
 10
1 7 10 6 5 2 3 8 9 4
 4
4 3 2 1
 4
2 1 3 4
 10
1 10 9 5 3 2 4 7 8 6
 4
2 3 1 4
 4
2 4 3 1
 10
1 5 10 8 4 3 9 2 7 6
 4
1 4 3 2
 10
1 8 10 6 2 4 9 3 7 5
 4
2 3 4 1
 10
2 6 10 1 9 7 4 8 5 3
 4
4 1 2 3
 10
1 9 10 5 6 7 3 8 4 2
 4
4 2 1 3
 4
3 1 4 2
 10
1 2 3 4 6 5 7 9 10 8
 4
4 3 1 2
 4
1 3 4 2
 10
2 5 10 3 6 4 9 1 8 7
 10
2 1 10 5 8 4 9 3 7 6
 4
3 1 2 4
 10
1 6 10 7 9 5 3 8 4 2
 2
1 2
 10
1 3 10 9 4 7 5 8 6 2
 4
1 3 2 4
 4
4 2 3 1
 4
3 2 1 4
 4
3 2 4 1
 4
1 2 3 4
 10
2 7 10 1 6 3 4 8 9 5
 2
2 1
 4
3 4 2 1
 4
3 4 1 2
 10
10 1 9 2 8 3 7 4 6 5
 10
1 4 10 8 9 2 3 6 7 5
 10
2 3 10 5 4 8 6 9 7 1
 108
1 102 33 99 6 83 4 20 61 100 76 71 44 9 24 87 57 2 81 82 90 85 12 30 66 53 47 36 43 29 31 64 96 84 77 23 93 78 58 68 42 55 13 70 62 19 92 14 10 65 63 75 91 48 11 105 37 50 32 94 18 26 52 89 104 106 86 97 80 95 17 72 40 22 79 103 25 101 35 51 15 98 67 5 34 69 54 27 45 88 56 16 46 60 74 108 21 41 73 39 107 59 3 8 28 49 7 38
 4
4 1 3 2
 4
2 4 1 3
 10
2 4 10 3 9 1 5 7 8 6
 4
1 4 2 3

2 0
 4 0
 26 5
 26 6
 4 1
 2 0
 20 7
 4 0
 2 1
 26 6
 4 0
 24 6
 0 1
 28 1
 0 3
 26 1
 2 3
 4 1
 6 0
 2 2
 2 1
 28 0
 28 0
 2 3
 24 4
 0 0
 22 1
 2 0
 4 1
 4 0
 2 1
 0 0
 20 7
 0 1
 2 2
 0 2
 24 7
 20 5
 14 1
 3428 30
 2 3
 2 2
 28 0
 4 0

#include <bits/stdc++.h>
using namespace std;
int n, p[1000010], a[1000010], addall, cnt0, cnt1, cnt2;
long long tmp;
vector<int> v[1000010];
bool flag[1000010];
int ask(int x) { return a[x] + addall; }
long long Abs(long long x) {
  if (x < 0) return -x;
  return x;
}
void dec(int n) {
  if (p[n] - ask(n) > 0)
    cnt1--;
  else if (p[n] - ask(n) == 0)
    cnt0--;
  else
    cnt2--;
  tmp -= cnt1;
  tmp += cnt2 + cnt0;
  tmp -= Abs(p[n] - ask(n));
  addall++;
  a[n] = 1 - addall;
  tmp += Abs(p[n] - ask(n));
  if (p[n] - ask(n) == 0)
    cnt0++;
  else
    cnt1++;
}
void add(int j, int v) {
  if (p[j] - ask(j) > 0)
    cnt1 += v;
  else if (p[j] - ask(j) == 0)
    cnt0 += v;
  else
    cnt2 += v;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    a[i] = i;
    if (p[i] > i) {
      cnt1++;
      tmp += p[i] - (long long)i;
      v[p[i] - i].push_back(i);
    } else if (p[i] == i) {
      cnt0++;
      v[0].push_back(i);
    } else if (p[i] < i) {
      cnt2++;
      tmp += i - (long long)p[i];
    }
    v[n - i].push_back(i);
    if (n - i + p[i] - 1 < n) v[n - i + p[i] - 1].push_back(i);
  }
  long long ans = tmp;
  int tk = 0;
  dec(n);
  for (int i = 0; i < v[0].size(); i++) {
    int j = v[0][i];
    if (j == n || flag[j]) continue;
    flag[j] = 1;
    addall--, add(j, -1);
    addall++, add(j, 1);
  }
  for (int i = 0; i < v[1].size(); i++) {
    int j = v[1][i];
    if (j == n || flag[j]) continue;
    flag[j] = 1;
    addall--, add(j, -1);
    addall++, add(j, 1);
  }
  for (int i = 0; i < v[0].size(); i++) flag[v[0][i]] = 0;
  for (int i = 0; i < v[1].size(); i++) flag[v[1][i]] = 0;
  for (int k = 1; k < n; k++) {
    if (tmp < ans) ans = tmp, tk = k;
    dec(n - k);
    for (int i = 0; i < v[k].size(); i++) {
      int j = v[k][i];
      if (j == n - k || flag[j]) continue;
      flag[j] = 1;
      addall--, add(j, -1);
      addall++, add(j, 1);
    }
    for (int i = 0; i < v[k + 1].size(); i++) {
      int j = v[k + 1][i];
      if (j == n - k || flag[j]) continue;
      flag[j] = 1;
      addall--, add(j, -1);
      addall++, add(j, 1);
    }
    for (int i = 0; i < v[k].size(); i++) flag[v[k][i]] = 0;
    for (int i = 0; i < v[k + 1].size(); i++) flag[v[k + 1][i]] = 0;
  }
  cout << ans << ' ' << tk << endl;
  return 0;
}
