#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll=long long;
int main() {
	ll n, d=0, p=0, nul=-1, egy=-1; cin>>n; vector<int> comp(n);
	priority_queue<pair<ll, pair<int, int>>> que;
	bool ketto=false;
	for(int i=0; i<n; i++){
		cin>>comp[i];
		if(abs(comp[i])==2) ketto = true;
		else if(comp[i]==1) egy=i;
		else if(comp[i]==0) nul=i;
	}
	if(n==1){
		cout<<1<<" "<<1; return 0;
	}
	int beg=-1, end;
	for(int i=0; i<=n; i++){
		if((i!=n&&comp[i]==0)||i==n){
			end=i;
			if(end-beg<2){	
				beg=end; d=0; p=0;		
				continue;
			}
			if(p%2==1){
				int a=beg+1, b=end-1, ad=0, bd=0;
				while(comp[a]>0&&a<end){
					if(comp[a]==2) ad++;
					a++;
				}
				if(a<end&&comp[a]==-2) ad++;
				while(comp[b]>0&&b>beg){
					if(comp[b]==2) bd++;
					b--;
				}
				if(b>beg&&comp[b]==-2) bd++;
				if(b>beg&&b-bd>a-ad) que.push({b-bd, {beg+1, b-1}});
				else if(a<end) que.push({a-ad, {a+1, end-1}});
			} 
			else{
				que.push({d, {beg+1, end-1}});
			}
			beg=end;
			d=0;
			p=0;
		}
		else if(abs(comp[i])==2) d++;
		if(i<n&&comp[i]<0) p++;
	}
	if(!ketto){
		if(egy!=-1) cout<<egy+1<<" "<<egy+1;
		else if(nul!=-1)cout<<nul+1<<" "<<nul+1;
		else cout<<1<<" "<<2;
	}
	else cout<<que.top().second.first+1<<" "<<que.top().second.second+1;
}