Problem: Gardener Alex loves to grow trees. We remind that tree is a connected acyclic graph on n vertices. 

Today he decided to grow a rooted binary tree. A binary tree is a tree where any vertex has no more than two sons. Luckily, Alex has a permutation of numbers from 1 to n which he was presented at his last birthday, so he decided to grow a tree according to this permutation. To do so he does the following process: he finds a minimum element and makes it a root of the tree. After that permutation is divided into two parts: everything that is to the left of the minimum element, and everything that is to the right. The minimum element on the left part becomes the left son of the root, and the minimum element on the right part becomes the right son of the root. After that, this process is repeated recursively on both parts.

Now Alex wants to grow a forest of trees: one tree for each cyclic shift of the permutation. He is interested in what cyclic shift gives the tree of minimum depth. Unfortunately, growing a forest is a hard and long process, but Alex wants the answer right now. Will you help him?

We remind that cyclic shift of permutation a_1, a_2, …, a_k, …, a_n for k elements to the left is the permutation a_{k + 1}, a_{k + 2}, …, a_n, a_1, a_2, …, a_k.

Input

First line contains an integer number n ~ (1 ⩽ n ⩽ 200 000) — length of the permutation.

Second line contains n integer numbers a_1, a_2, …, a_n ~ (1 ⩽ a_i ⩽ n), and it is guaranteed that all numbers occur exactly one time.

Output

Print two numbers separated with space: minimum possible depth of a tree and how many elements we need to shift left to achieve this depth. The number of elements should be a number from 0 to n - 1. If there are several possible answers, print any of them.

Example

Input


4
1 2 3 4


Output


3 2

Note

The following picture depicts all possible trees for sample test and cyclic shifts on which they are achieved. 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int kInf = 0x3f3f3f3f, kMod = 1e9 + 7;
const long long kInf64 = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void UMin(T& x, const T& y) {
  if (x > y) x = y;
}
template <typename T>
inline void UMax(T& x, const T& y) {
  if (x < y) x = y;
}
inline int Add(int a, int b) { return (a += b) >= kMod ? a - kMod : a; }
inline int Sub(int a, int b) { return (a -= b) < 0 ? a + kMod : a; }
inline int Mul(int a, int b) { return 1ll * a * b % kMod; }
int FPow(int bs, int ex = kMod - 2) {
  int res = 1;
  for (; ex; bs = Mul(bs, bs), ex >>= 1)
    if (ex & 1) res = Mul(res, bs);
  return res;
}
const int kMaxn = 2e5 + 5;
int n, top, dfs_clock;
namespace smt {
struct Node {
  int max, tag;
} T[kMaxn << 2];
inline int Id(int l, int r) { return l + r | l != r; }
inline int Query() { return T[Id(1, n * 2)].max; }
void Modify(int l, int r, int ql, int qr, int d);
}  // namespace smt
int A[kMaxn << 1], S[kMaxn << 1], idfn[kMaxn << 1];
int ch[kMaxn << 1][2], fa[kMaxn << 1], odfn[kMaxn << 1];
void Dfs(int u);
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", A + i);
    A[n + i] = A[i];
  }
  for (int i = 1, la; i <= n * 2; ++i) {
    la = -1;
    for (int v; top;) {
      if (A[v = S[top - 1]] <= A[i]) {
        if (ch[v][1]) {
          ch[i][0] = ch[v][1];
          fa[ch[v][1]] = i;
        }
        fa[ch[v][1] = i] = v;
        break;
      }
      la = S[--top];
    }
    if (!top && ~la) fa[ch[i][0] = la] = i;
    S[top++] = i;
  }
  Dfs(S[0]);
  for (int i = 1; i <= n; i++) smt::Modify(1, n << 1, idfn[i], odfn[i], 1);
  int ans = smt::Query(), k = 0;
  for (int i = n + 1; i <= n * 2; i++) {
    smt::Modify(1, n << 1, idfn[i - n], odfn[i - n], -1);
    smt::Modify(1, n << 1, idfn[i], odfn[i], 1);
    if (smt::Query() < ans) {
      ans = smt::Query(), k = i - n;
    }
  }
  printf("%d %d\n", ans, k);
  return 0;
}
namespace smt {
void PushDown(int l, int mid, int r) {
  int cur = Id(l, r);
  if (T[cur].tag) {
    int ls = Id(l, mid), rs = Id(mid + 1, r);
    T[ls].max += T[cur].tag, T[ls].tag += T[cur].tag;
    T[rs].max += T[cur].tag, T[rs].tag += T[cur].tag;
    T[cur].tag = 0;
  }
}
void Modify(int l, int r, int ql, int qr, int d) {
  int cur = Id(l, r);
  if (ql <= l && r <= qr) {
    T[cur].max += d, T[cur].tag += d;
    return;
  }
  int mid = l + r >> 1;
  PushDown(l, mid, r);
  if (ql <= mid) Modify(l, mid, ql, qr, d);
  if (qr > mid) Modify(mid + 1, r, ql, qr, d);
  T[cur].max = std::max(T[Id(l, mid)].max, T[Id(mid + 1, r)].max);
}
}  // namespace smt
void Dfs(int u) {
  idfn[u] = ++dfs_clock;
  if (ch[u][0]) Dfs(ch[u][0]);
  if (ch[u][1]) Dfs(ch[u][1]);
  odfn[u] = dfs_clock;
}