#include <bits/stdc++.h>
#include<queue>

/*
11
7 11 42 10 9 78 3 12 20 11 33
*/
/*
8
10 3 10 3 3 10 3 10

*/
using namespace std;

bool rendez(pair<int, int> a, pair<int, int> b )
{
    if (a.first>b.first)
        return true;
    else if (a.first==b.first)
        return a.second<b.second;
    return false;
}

int main()
{
    int utolso,eleje=-1,vege=-1,index;
    int n;
    cin>>n;
    utolso=n-1;
    bool volte[n];
    vector<int> a(n);
    vector<pair<int, int>> seged;
    for(int i=0;i<n;i++)
    {
        cin>>a.at(i);
        volte[i]=false;
        seged.push_back(make_pair(a[i],i));
    }

    sort(seged.begin(), seged.end(), rendez);
   // cout<<"\t"<<eleje<<" "<<vege<<" "<<utolso;
     //   cout<<endl;
    for(pair<int, int> x: seged)
    {
        index=x.second;
        volte[index]=true;
        while (a[utolso]==a[index] || volte[utolso] )
            {volte[utolso]=true;utolso--;}
        if(index!=utolso  && utolso-index>=vege-eleje)
        {
            eleje=index;
            vege=utolso;
        }
        while(volte[utolso])
            utolso--;
/*
        for(bool x:volte)
            cout<<x<<" ";
        cout<<"\t"<<eleje<<" "<<vege<<" "<<utolso;
        cout<<endl;
*/

    }
    if(eleje==-1)
    {
        cout<<-1;
        return 0;
    }
    cout<<eleje+1<<" "<<vege+1;
  return 0;
}