#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>

using namespace std;

int main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	vector<int> vec(n);
	for (int i = 0; i < n; i++) {
		cin >> vec[i];
	}

	int maxtwos = -1, maxl = 0, maxr = 0, l = 0, twos = abs(vec[0]) == 2;
	bool sign = vec[0] >= 0;
	for (int i = 1; i < n; i++) {
		if (vec[i - 1] == 0) {
			sign = vec[i] >= 0;
			twos = abs(vec[i]) == 2;
			l = i;
		}
		else {
			sign ^= vec[i] < 0;
			twos += abs(vec[i]) == 2;
		}
		if (maxtwos < twos && sign) {
			maxtwos = twos;
			maxl = l;
			maxr = i;
		}
	}
	twos = abs(vec[n - 1]) == 2, sign = vec[n - 1] >= 0;
	for (int i = n-2; i >= 0; i--) {
		if (vec[i + 1] == 0) {
			sign = vec[i] >= 0;
			twos = abs(vec[i]) == 2;
			l = i;
		}
		else {
			sign ^= vec[i] < 0;
			twos += abs(vec[i]) == 2;
		}
		if (maxtwos < twos && sign) {
			maxtwos = twos;
			maxl = i;
			maxr = l;
		}
	}
	if (maxtwos == -1) {
		int maxv = vec[0];
		for (int i = 1; i < n; i++) {
			maxv = max(maxv, vec[i]);
			if (vec[i - 1] == -1 && vec[i] == -1) {
				cout << i - 1 << ' ' << i;
				return 0;
			}
			if (maxv == 1) {
				cout << i << ' ' << i;
				return 0;
			}
		}
	}

	cout << maxl + 1 << ' ' << maxr + 1;
}