#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,cnt,a[N],b[N],bt[N];
vector<int> ans;
bool fl=0;
void upd(int x,int w)
{
    for(;x<=n;x+=x&-x)
        bt[x]+=w;
}
int qry(int x)
{
    int res=0;
    for(;x;x-=x&-x)
        res+=bt[x];
    return res;
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;++i)
        scanf("%d",&a[i]),b[a[i]]=i;
    for(int i=n;i;--i)
    {
        if(i<n && b[i]>b[i+1]) fl=1;
        if(fl)
        {
            ++cnt;
            ans.push_back(b[i]-qry(b[i]));
            upd(b[i],1);
        }
    }
    printf("%d %d\n",cnt,cnt);
    for(auto i:ans)
        printf("%d 1\n",i);
    return 0;
}