#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n; cin >> n;
    vector<pair<int, int>> v(n + 1);
    for (int i = 1; i <= n; ++i) {
        v[i].second = i;
        cin >> v[i].first;
    }

    sort(v.begin(), v.end());
    int maxi = 0, res = -1, kezd = -1, ind = -1;
    for (auto& e : v) {
        if (e.second > maxi) maxi = e.second;
        else if (maxi - e.second > res) {
            res = maxi - e.second;
            kezd = e.second;
            ind = maxi;
        }
    }
    if (kezd == -1) cout << -1;
    else cout << kezd << " " << ind;
}