#include <iostream>

using namespace std;

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

int kereses(int a)
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int temp=0;
    int szabaly=0;
    for (int i=a;i<=n;i++)
    {
        if (tomb[a] == tomb[i])
        {
            temp++;
        } else {
            if (tomb[a] == tomb[i]+1 && (szabaly == 1 || szabaly == 0))
            {
                temp++;
                szabaly = 1;
            } else {
                if (tomb[a] == tomb[i]-1 && (szabaly == -1 || szabaly == 0))
                {
                    temp++;
                    szabaly = -1;
                } 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 << nagysag << " " << nagyhely;


    return 0;
}