#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned int;
#define rep(i,n) for(int i=0; i<(n); i++)



int main() {
    int N; cin >> N;
    vector<int> A(N); rep(i,N){ int a; cin >> a; A[i] = a-1; }

    vector<int> P(N); rep(i,N) P[A[i]] = i;
    vector<int> dir(N);
    rep(t,2){
        vector<int> maxG(N+2, -1);
        rep(i,N) maxG[P[i]+1] = max(maxG[i+1], i);
        rep(i,N){
            int p = P[i];
            if(maxG[p] > maxG[p+2]){
                P[i]--;
                dir[p] = 0;
            }
            else{
                P[i]++;
                dir[p] = 1;
            }
        }
    }

    int blockcnt = 1;
    vector<int> sep = {0};
    rep(i,N-1) if(dir[i] == 0 && dir[i+1] == 1){ blockcnt++; sep.push_back(i+1); }
    sep.push_back(N);

    int blockt = 0;
    rep(i,sep.size()-1){
        int l = sep[i], r = sep[i+1];
        int m = l;
        while(m < r && dir[m] == 1) m++;
        blockt = max(m-l, r-m) - 1;
    }
    cout << blockt << " " << blockcnt << "\n";
    return 0;
}




struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;