#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int vys1=-1, vys2=-1;

void over(vector<int> A) {
    sort(A.begin(), A.end());
    for (int i=0; i+1 < int(A.size()); ++i)
        if (vys2-vys1 < A[i+1]-A[i] ||
	    (vys2-vys1 == A[i+1]-A[i] && A[i+1]>vys2))
	    { vys1=A[i]; vys2=A[i+1]; }
}

int main() {
    int n;
    scanf("%d", &n);
    vector< pair<int,int> > T;
    for (int i=0; i<n; ++i) {
        int t;
        scanf("%d", &t);
        T.push_back(make_pair(t, i));
    }
    sort(T.begin(), T.end());

    vector<int> p, d, spolu;
    int kde=0;
    while (kde != n && T[kde].first == T[0].first)
        p.push_back(T[kde++].second);
    over(p);
    while (kde != n) {
        int zac = kde;
        d.clear();
        while (kde!=n && T[kde].first == T[zac].first)
	    d.push_back(T[kde++].second);
        over(d);
        spolu=p;
	for (int x:d)
	    spolu.push_back(x);
        over(spolu);
        p = d;
    }

    printf("%d %d\n", vys1, vys2);
    return 0;
}