#include <bits/stdc++.h>
using namespace std;
const int B = 100;
int main(){
  int N;
  cin >> N;
  vector<int> m(N);
  for (int i = 0; i < N; i++){
    cin >> m[i];
    m[i]--;
  }
  vector<vector<int>> p(B, vector<int>(N));
  for (int i = 0; i < N; i++){
    p[0][m[i]] = i;
  }
  bool ok = false;
  for (int i = 0; i < B - 1; i++){
    vector<int> mx(N, -1);
    for (int j = 0; j < N; j++){
      mx[p[i][j]] = max(mx[p[i][j]], j);
    }
    for (int j = 0; j < N; j++){
      if (p[i][j] == 0){
        p[i + 1][j] = 1;
      } else if (p[i][j] == N - 1){
        p[i + 1][j] = N - 2;
      } else if (mx[p[i][j] - 1] > mx[p[i][j] + 1]){
        p[i + 1][j] = p[i][j] - 1;
      } else {
        p[i + 1][j] = p[i][j] + 1;
      }
    }
    if (i >= 2){
      if (p[i] == p[i - 2]){
        int t = i - 2;
        set<int> st;
        for (int j = 0; j < N; j++){
          st.insert(p[i][j] + p[i + 1][j]);
        }
        cout << t << ' ' << st.size() << endl;
        ok = true;
      }
    }
  }
  if (!ok){
    vector<int> M(N, -1);
    for (int i = 0; i < N; i++){
      M[p[B - 1][i]] = max(M[p[B - 1][i]], i);
    }
    for (int i = 0; i <= N - 5; i++){
      if (M[i] >= 0 && M[i + 1] >= 0 && M[i + 2] >= 0 && M[i + 3] >= 0 && M[i + 4] >= 0){
        assert(!(M[i + 2] < M[i] && M[i] < M[i + 1] && M[i + 4] < M[i + 2] && M[i + 2] < M[i + 3]));
      }
    }
  }
}