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

int main()
{
    int n; cin>>n;
    vector<array<int, 2>> v(n);
    for(int i=0; i<n; i++)
    {
        cin>>v[i][0];
        v[i][1]=i;
    }
    sort(v.begin(),v.end());
    vector<int> be;
    int maxi=0,l=-1,r=-1,last=1e6;
    for(auto [ert,ind]:v)
    {
        if(last!=ert)
        {
            for(int &x:be)
                maxi=max(maxi,x);
            be.clear();
            last=ert;
        }
        if(maxi-ind>r-l || maxi-ind==r-l && ind<l) l=ind,r=maxi;
        be.push_back(ind);
    }
    if(l<0) cout<<"-1\n";
    else cout<<l+1<<" "<<r+1<<"\n";
}