using namespace std;

int n,k,tomb[10000];
int nagyhely,nagysag;

int kereses(int a)
{
    int temp=0;
    for (int i=a;i<=n;i++)
    {
        if (tomb[i]+1 == tomb[i+1] || tomb[i]-1 == tomb[i+1] || tomb[i] == tomb[i+1]) {
            temp++;
        } else return temp;
    }
    return temp;
}


int main()
{
    cin >> n;
    for (int i=1;i<=n;i++)
    {
        cin >> tomb[i];
    }

    for (int i=1;i<=n;i++)
    {
        if (nagysag < kereses(i)) {
            nagysag = kereses(i);
            nagyhely = i;
        }
    }

    cout << nagyhely << " " << nagysag;


    return 0;
}