// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int INF = 1e12;

signed main() {
    int n;cin>>n;
    vector<int> v(n),mx(n);
    deque<int> q;
    for(int i = 0;i<n;i++){
        cin>>v[i];
        if(i==0)mx[0]=v[0];
        else{
            mx[i]=max(mx[i-1],v[i]);
        }
    }
    vector<int> a;
    a=v;
    sort(a.begin(),a.end());
    if(a==v){
        cout<<-1;
        return 0;
    }
    int ans1,ans2,maxi=-1;;
    for(int i = 0;i<n;i++){
        int l=-1,m,h=i;
        while(l<h-1){
            m=(l+h)/2;
            if(mx[m]>=v[i]){
                h=m;
            }
            else{
                l=h+1;
            }
        }
        if(maxi<i-h){
            maxi=i-h;
            ans1=h;
            ans2=i;
        }
    }
    cout<<ans1+1<<' '<<ans2+1<<endl;

}