#include <iostream>

using namespace std;

int main()
{
    int n,a[100001],r,db,j,max=0,t;
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for (int i=1;i<=n-max+1;i++)
    {
        db=1;
        r=a[i];
        j=i;
        while (a[j+1]==r && j<n)
        {
            db++;
            j++;
        }
        if (a[j+1]==r+1)
        {
            while ((a[j+1]==r || a[j+1]==r+1) && j<n)
            {
                db++;
                j++;
            }
        }
        else if (a[j+1]==r-1)
        {
            while ((a[j+1]==r || a[j+1]==r-1) && j<n)
            {
                db++;
                j++;
            }
        }
        if (db>max)
        {
            max=db;
            t=i;
        }
    }
    cout<<max<<" "<<t;
    return 0;
}