#include <bits/stdc++.h>
const int N = 400005;
int t[N << 2], tag[N << 2], n, a[N], tp, st[N], ans, kans, l[N], r[N];
void pushdown(int k) {
  if (tag[k]) {
    t[k << 1] += tag[k], tag[k << 1] += tag[k];
    t[k << 1 | 1] += tag[k], tag[k << 1 | 1] += tag[k];
    tag[k] = 0;
  }
}
void modify(int k, int L, int R, int l, int r, int x) {
  if (L == l && R == r) {
    t[k] += x, tag[k] += x;
    return;
  }
  int mid = (L + R) >> 1;
  pushdown(k);
  if (r <= mid)
    modify(k << 1, L, mid, l, r, x);
  else if (l > mid)
    modify(k << 1 | 1, mid + 1, R, l, r, x);
  else {
    modify(k << 1, L, mid, l, mid, x);
    modify(k << 1 | 1, mid + 1, R, mid + 1, r, x);
  }
  t[k] = std::max(t[k << 1], t[k << 1 | 1]);
}
int query(int k, int L, int R, int l, int r) {
  if (L == l && R == r) return t[k];
  int mid = (L + R) >> 1;
  pushdown(k);
  if (r <= mid) return query(k << 1, L, mid, l, r);
  if (l > mid) return query(k << 1 | 1, mid + 1, R, l, r);
  return std::max(query(k << 1, L, mid, l, mid),
                  query(k << 1 | 1, mid + 1, R, mid + 1, r));
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = n + 1; i <= 2 * n; i++) a[i] = a[i - n];
  for (int i = 1; i <= 2 * n; i++) {
    while (tp && a[st[tp]] >= a[i]) tp--;
    l[i] = tp ? st[tp] + 1 : 1;
    st[++tp] = i;
  }
  tp = 0;
  for (int i = 2 * n; i >= 1; i--) {
    while (tp && a[st[tp]] >= a[i]) tp--;
    r[i] = tp ? st[tp] - 1 : 2 * n;
    st[++tp] = i;
  }
  for (int i = 1; i <= n; i++) modify(1, 1, 2 * n, l[i], r[i], 1);
  ans = query(1, 1, 2 * n, 1, n);
  kans = 0;
  for (int i = 1; i < n; i++) {
    modify(1, 1, 2 * n, l[i], r[i], -1);
    modify(1, 1, 2 * n, l[i + n], r[i + n], 1);
    int t = query(1, 1, 2 * n, i + 1, i + n);
    if (t < ans) ans = t, kans = i;
  }
  printf("%d %d\n", ans, kans);
}
