#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n; cin>>n;
    int c=1e5+10;
    vector<vector<int>> pos(c);
    vector<int> v(n+1);
    for(int i=1; i<=n; i++)
    {
        cin>>v[i];
        pos[v[i]].push_back(i);
    }
    int ans=1,l=1,r=1;
    for(int i=1; i<c-1; i++)
    {
        int ind1=0,ind2=0;
        int tmp=0,last=-1,kov=-1,kezd=-1;
        pos[i].push_back(n+10);
        int mer1=pos[i].size(),mer2=pos[i+1].size();
        while(ind1<mer1 || ind2<mer2)
        {
            if(ind1==mer1 || (ind2<mer2 && pos[i+1][ind2]<pos[i][ind1]))
            {
                kov=pos[i+1][ind2];
                if(kov!=last+1)
                {
                    if(tmp>ans || (tmp==ans && kezd<l))
                    {
                        ans=tmp,l=kezd,r=last;
                    }
                    tmp=0,kezd=kov,last=kov;
                }
                tmp++,ind2++,last=kov;
            }
            else
            {
                kov=pos[i][ind1];
                if(kov!=last+1)
                {
                    if(tmp>ans || (tmp==ans && kezd<l))
                    {
                        ans=tmp,l=kezd,r=last;
                    }
                    tmp=0,kezd=kov,last=kov;
                }
                tmp++,last=kov,ind1++;
            }
            pos[i].pop_back();
        }
    }
    cout<<ans<<" "<<l<<"\n";

}