#include <iostream>
#include <vector>
#include <algorithm>
//#include <fstream>
using namespace std;

//ifstream fin("be2.txt");

struct adat
{
    int nr, original_index, curr_max_index;
};

int comp(adat a, adat b)
{
    return a.nr < b.nr;
}

vector<adat> x;
pair<int, int> sol;
int n, i, maximum_dist, maximum_index;

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

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

    sort(x.begin()+1, x.end(), comp);

    maximum_index = 0;
    for (i = 1; i <= n; ++i)
    {
        if (x[i].original_index > maximum_index)
        {
            maximum_index = x[i].original_index;
        }
        x[i].curr_max_index = maximum_index;
    }

    /* for (auto &e : x)
    {
        cout << e.nr << " ";
    }
    cout << endl;
    for (auto &e : x)
    {
        cout << e.original_index << " ";
    }
    cout << endl;
    for (auto &e : x)
    {
        cout << e.curr_max_index << " ";
    } */

    maximum_dist = 0;
    for (i = 1; i <= n; ++i)
    {
        int dist = x[i].curr_max_index - x[i].original_index;  // Since curr_max_index >= original_index, abs is unnecessary
        if (dist > maximum_dist || (dist == maximum_dist && x[i].original_index < sol.first))
        {
            maximum_dist = dist;
            sol.first = x[i].original_index;
            sol.second = x[i].curr_max_index;
        }
    }

    if (maximum_dist == 0)
        cout << -1;
    else
        cout << sol.first << " " << sol.second;

    return 0;
}