#include<cstdio>

#include<iostream>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<cmath>

#include<vector>

#define qq(o,l,x) upper_bound(o+1,o+l+1,x)-o-1

using namespace std;

const int _=1e2;

const int maxn=*1e5+_;

const int fbin=;

int n,a[maxn],lslen,ls[maxn];

int read()

{

    int x=,f=;char ch=getchar();

    while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}

    while(isdigit(ch)){x=x*+ch-'';ch=getchar();}

    return x*f;

}

//--------------------------------------def------------------------------------------

struct stack

{

    int top,sta[maxn],d[maxn];

    stack(){}

    void clear(int k){top=;}

    void push(int p,int x)

    {

        while(top>=&&d[top]>=x)top--;

        sta[++top]=p;d[top]=x;

    }

    int findmner(int x){return sta[qq(d,top,a[x])];}

};

//~~~~~~~~stack~~~~~~~~~

int Bin[fbin],Log[maxn],f[fbin][maxn],d[fbin][maxn];

void initst()

{

    Bin[]=;for(int i=;i<=;i++)Bin[i]=Bin[i-]*;

    Log[]=;for(int i=;i<=n; i++)Log[i]=Log[i/]+;

    for(int i=;i<=n;i++)f[][i]=a[i];

    for(int j=;Bin[j]<=n;j++)

        for(int i=;i+Bin[j]-<=n;i++)

            f[j][i]=max(f[j-][i],f[j-][i+Bin[j-]]),

            d[j][i]=max(d[j-][i],d[j-][i+Bin[j-]]);

}

int RMQ(int x,int y)

{

    int k=Log[y-x+];

    return max(f[k][x],f[k][y-Bin[k]+]);

}

//~~~~~~~~RMQ~~~~~~~~~~~

//--------------------------------------data structure-----------------------------------------

int mnL[maxn],mnR[maxn];//作为唯一最小的区间

stack up;vector<int>vec[maxn];

int main()

{

    freopen("26.in","r",stdin);

    freopen("a.out","w",stdout);

    n=read();

    for(int i=;i<=n;i++)

        a[i]=read(),ls[++lslen]=a[i];

    sort(ls+,ls+lslen+);

    lslen=unique(ls+,ls+lslen+)-ls-;

    for(int i=;i<=n;i++)

    {

        a[i]=lower_bound(ls+,ls+lslen+,a[i])-ls;

        vec[a[i]].push_back(i);

    }

    initst();

    up.clear(),up.push(,-(<<));

    for(int i=;i<=n;i++)

        mnL[i]=up.findmner(i)+,up.push(i,a[i]);

    up.clear(),up.push(n+,-(<<));

    for(int i=n;i>=;i--)

        mnR[i]=up.findmner(i)-,up.push(i,a[i]);

    int ans=,ll;

    for(int i=;i<=n;i++)

    {

        int p=RMQ(mnL[i],mnR[i]);

        if(vec[p].front()<=i)

        {

            int u=upper_bound(vec[p].begin(),vec[p].end(),i)-vec[p].begin()-;

            int L=mnL[i],R=mnR[i];

            if(u!=)L=max(L,vec[p][u-]+);

            if(u!=vec[p].size()-)R=min(R,vec[p][u+]-);

            if(R-L+>ans || R-L+==ans&&ll>L )ans=R-L+,ll=L;

        }

        if(vec[p].back()>=i)

        {

            int u=lower_bound(vec[p].begin(),vec[p].end(),i)-vec[p].begin();

            int L=mnL[i],R=mnR[i];

            if(u!=)L=max(L,vec[p][u-]+);

            if(u!=vec[p].size()-)R=min(R,vec[p][u+]-);

            if(R-L+>ans || R-L+==ans&&ll>L )ans=R-L+,ll=L;

        }

    }

    printf("%d %d\n",ans,ll);

    return ;

}