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;
#define rep(i, a, b) for(int i = a; i < b; (a < b) ? ++i : --i)
#define int int64_t

const int N = 1e6 + 10, M = 3e6 + 30;

int n, p[M], f[M], k, cur, ans, sum, opt, cn, cnt[M], pr[M], sf[M];

main() {
    cin >> n;
    rep(i, 0, n) {
        scanf("%lld", &p[i]);
        --p[i];
        f[i] = p[i] - i;
        cnt[f[i] + N]++;
    }
    opt = 0, ans = 1e17;
    k = 0, sum = 0;
    for (int i = k; i >= -n - 1; --i) {
        cn += cnt[i + N];
        sum += abs(i - k) * cnt[i + N];
    }
    for (int i = n - 1; i >= 0; --i) {
        cnt[f[i] + N]--;
        if (f[i] <= k) {
            ++cn;
            sum -= abs(k - f[i]);
        }
        cnt[f[i] + n + N]++;
        k++;
        sum += cn;
        cn += cnt[k + N];
        sf[i] = sum;
    }
    rep(i, 0, M)
        cnt[i] = 0;
    cn = sum = 0;
    rep(i, 0, n)
        cnt[f[i] + N]++;
    k = 0;
    for (int i = k; i <= n + 1; ++i) {
        cn += cnt[i + N];
        sum += abs(k - i) * cnt[i + N];
    }
    rep(i, 0, n) {
        cnt[f[i] + N]--;
        if (f[i] >= k) {
            --cn;
            sum -= abs(k - f[i]);
        }
        cnt[f[i] - n + N]++;
        k--;
        sum += cn;
        cn += cnt[k + N];
        pr[(i + 1) % n] = sum;
    }
    rep(i, 0, n) {
        cur = pr[i] + sf[i];
        k = n - (i ? i : n);
        if (cur < ans)
            ans = cur, opt = k;
    }
    cout << ans << ' ' << opt;
    return 0;
}
