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

int n, i, forstart, akt, p = 1;
vector<int> sol;
vector<int> x;

void search(int start, int akt)
{
    for (int i = n; i > start; --i)
    {
        if (x[i] < x[akt])
        {
            sol[akt] = i;
            p = i;
            break;
        }
    }
}

int main()
{
    cin >> n;
    x.resize(n + 1);
    sol.resize(n + 1);

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

    forstart = 1;
    akt=1;
    while (forstart < n)
    {
        p = -1;
        search(forstart, akt);
        if (p == -1)
            ++forstart;
        else
            forstart = p+1;
        ++akt;
    }

    /*for (i = 1; i <= n; ++i)
    {
        cout << i << " " << sol[i] << endl;
    }*/

    p = -1;
    int maxi = 0;
    for (i = 1; i <= n; ++i)
    {
        if (sol[i] - i > maxi)
        {
            maxi = sol[i] - i;
            p = i;
        }
    }

    if (p != -1)
    {
        cout << p << " " << sol[p];
    }
    else
    {
        cout << p;
    }

    return 0;
}