#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int n; cin >> n;
	vector<pair<int, int>> v(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i].first;
		v[i].second = i + 1;
	}

	sort(v.begin(), v.end());

	int maxi = 1, pi1, pi2, pj1, pj2, s, ans = 1;
	for (int i = 1; i < n; ++i) {
		for (int j = i - 1; j >= 0; --j) {
			if (v[i].second > v[j].first) {
				s = abs(v[j].second - v[i].second);
				if (s > maxi) {
					maxi = s;
					pi1 = v[j].second;
					pj1 = v[i].second;
				}
			}
			else break;
		}
		if (maxi > ans) {
			ans = maxi;
			pi2 = pi1;
			pj2 = pj1;
		}
	}
	cout << pi2 - 1 << " " << pj2 << "\n";
}