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

#define int long long

#define pii pair<int, int>

void prev_greater(vector<int>& r, const vector<int>& a) {
	stack<int> s;
	for (int i = 0; i < a.size(); i++) {
		while (!s.empty() && a[s.top()] <= a[i]) {
			s.pop();
		}
		r[i] = s.empty() ? -1 : s.top();
		s.push(i);
	}
}

void next_greater(vector<int>& r, const vector<int>& a) {
	stack<int> s;
	for (int i = a.size() - 1; i >= 0; i--) {
		while (!s.empty() && a[s.top()] <= a[i]) {
			s.pop();
		}
		r[i] = s.empty() ? a.size() : s.top();
		s.push(i);
	}
}

signed main() {
#ifdef CB
	ifstream fin("be2.txt");
	cin.rdbuf(fin.rdbuf());
	ofstream fout("ki.txt");
#endif
	int N;
	cin >> N;
	vector<int> v(N);
	for (int i = 0; i < N; i++) {
		cin >> v[i];
	}
	vector<int> p(N), n(N);
	prev_greater(p, v);
	next_greater(n, v);
	int ans = 0;
	int ms, me;
	for (int i = 0; i < N; i++) {
		int s = i, e = i;
		int m = v[i];
		while (true) {
			bool bs = s - 1 > p[i] && m + v[s - 1] <= v[i] * 2;
			bool be = e + 1 < n[i] && m + v[e + 1] <= v[i] * 2;
			if (bs && be) {
				if (v[s - 1] <= v[e + 1]) {
					s--;
					m += v[s];
				}
				else {
					e++;
					m += v[e];
				}
			}
			else if (bs) {
				s--;
				m += v[s];
			}
			else if (be) {
				e++;
				m += v[e];
			}
			else {
				break;
			}
		}
		if (ans < e - s + 1) {
			ans = e - s + 1;
			ms = s;
			me = e;
		}
	}
	cout << ms + 1 << " " << me + 1 << endl;
	return 0;
}