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

int main()
{
    int n;
    cin>>n;
    int t[n];
    for(int i=0; i<n; i++) cin>>t[i];
    vector<int>v;
    int maxim=0, k=0;
    while(abs(t[k]-t[k+1]>1))
{
    k++;
}
v.push_back(t[k]);
v.push_back(t[k+1]);
int start=k;
int maxstart=0;
for(int i=k+2; i<n; i++)
    {
        if(abs(*min_element(v.begin(), v.end())-t[i])<=1 and abs(*max_element(v.begin(), v.end())-t[i])<=1){
           v.push_back(t[i]);
        }
        else{
            if(v.size()>maxim)
            {
                maxim=v.size();
                maxstart=start;
            }
            if(abs(t[i]-v.back())>=2)
            {
                start=start+v.size();
                v.clear();
            }
            else
            {
                for(int j=v.size()-1; j>=0; j--)
                {
                    if(v[j]!=v.back() and v[j]!=t[i])
                    {
                        v.erase(v.begin(), v.begin()+j+1);
                        start=start+j+1;
                        break;
                    }
                }
            }
            v.push_back(t[i]);
        }
}
cout<<maxim<<" "<<maxstart+1;
return 0;
}