#include <bits/stdc++.h>
using namespace std;
namespace ioput {
template <typename T>
T read() {
  T x = 0, f = 1;
  char c = getchar_unlocked();
  while ((c < '0') || (c > '9')) {
    if (c == '-') f = -1;
    c = getchar_unlocked();
  }
  while ((c >= '0') && (c <= '9'))
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar_unlocked();
  return x * f;
}
template <typename T>
void write(T x, char c) {
  static char t[20];
  static int tlen;
  t[tlen = 1] = c;
  if (x < 0) putchar_unlocked('-'), x = -x;
  do t[++tlen] = x % 10 + '0', x /= 10;
  while (x);
  while (tlen) putchar_unlocked(t[tlen--]);
}
}  // namespace ioput
using namespace ioput;
const int maxn = 10000005;
int p[maxn];
long long c[maxn], ans[maxn];
int main() {
  int n = read<int>();
  for (int i = 1, iend = n; i <= iend; ++i) {
    int t;
    p[i] = read<int>();
    if (p[i] >= i) {
      t = p[i] - i;
      --c[1], ++c[t + 1];
      ++c[t + 1], --c[n - i + 1];
      ans[n - i + 1] += 2 * p[i] - n - 1;
      --c[n - i + 2], ++c[n];
      ans[0] += p[i] - i;
    } else {
      t = p[i] - i + n;
      ++c[1], --c[n - i + 1];
      ans[n - i + 1] += 2 * p[i] - n - 1;
      --c[n - i + 2], ++c[t + 1];
      ++c[t + 1], --c[n];
      ans[0] += i - p[i];
    }
  }
  for (int i = 1, iend = n - 1; i <= iend; ++i)
    c[i] += c[i - 1], ans[i] += ans[i - 1] + c[i];
  int res = 0;
  for (int i = 1, iend = n - 1; i <= iend; ++i)
    if (ans[i] < ans[res]) res = i;
  write(ans[res], ' '), write(res, '\n');
  return 0;
}
