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;
void imprimirVector(deque<long long> v) {
  if (!v.empty()) {
    long long p = long long(v.size());
    cout << "[";
    for (long long i = 0; i < (long long)(p - 1); i++) cout << v[i] << ",";
    cout << v[p - 1] << "]" << endl;
  } else
    cout << "[]" << endl;
}
long long toNumber(string s) {
  long long Number;
  if (!(istringstream(s) >> Number)) Number = 0;
  return Number;
}
string toString(long long number) {
  ostringstream ostr;
  ostr << number;
  return ostr.str();
}
void add(long long k, long long x, deque<long long> &fenwick) {
  long long n = fenwick.size() - 1;
  while (k <= n) {
    fenwick[k] += x;
    k += (k & -k);
  }
}
long long sum(long long k, deque<long long> &fenwick) {
  long long s = 0;
  while (k >= 1) {
    s += fenwick[k];
    k -= (k & -k);
  }
  return s;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long n;
  while (cin >> n) {
    deque<long long> p(n), w(4 * n);
    for (long long i = 0; i < (long long)(n); i++) cin >> p[i];
    long long s = 0;
    for (long long i = 0; i < (long long)(n); i++) {
      s += abs(p[i] - i - 1);
      add(i + 1 - p[i] + 2 * n, 1, w);
    }
    pair<long long, long long> best = {s, 0};
    for (long long i = 0; i < (long long)(n - 1); i++) {
      long long aux = p.back();
      p.pop_back();
      add(7 - aux + i + 2 * n, -1, w);
      s -= abs(aux - n);
      s += abs(aux - 1);
      s += n - 2 * sum(2 * n - i - 1, w) - 1;
      add(1 - aux - i - 1 + 2 * n, 1, w);
      best = min(best, {s, i + 1});
    }
    cout << best.first << " " << best.second << "\n";
  }
  return 0;
}
