#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin >> n;

    vector<int> szamok(n);
    for(int i = 0; i < n; i++){
        cin >> szamok[i];
    }

    int bal = -1, jobb = -1;
    for(int i = 1; i < n; i++){
        int l = 0, r = i - 1;
        int a = i;
        while(l <= r){
            int k = (l + r) / 2;

            if(szamok[k] > szamok[i]){
                r = k - 1;
                a = k;
            } else{
                l = k + 1;
            }
        }

        if(jobb - bal < i - a){
            jobb = i + 1;
            bal = a + 1;
        }
        szamok[i] = max(szamok[i], szamok[i - 1]);
    }

    cout << bal;
    if(jobb != -1){
        cout << " " << jobb;
    }
    cout << "\n";
}