#include <bits/stdc++.h>
#include <cmath>
using namespace std;
using ll=long long;
int main() {
	
	ll n, d=1; cin>>n; vector<int> comp(n);
	priority_queue<pair<ll, pair<int, int>>> que;
	for(int i=0; i<n; i++){
		cin>>comp[i];
	}
	int beg=-1, end;
	for(int i=0; i<n; i++){
		if(comp[i]==0){
			end=i;
			if(end-beg<2){				
				que.push({0, {beg, end}}); beg++; continue;
			}
			if(d<0){
				int a=beg+1, b=end-1, da=d, db=d;
				while(da<0&&a<end){
					da/=comp[a];
					a++;
				}
				while(db<0&&b>beg){
					db/=comp[b];
					b--;
				}
				if(da<db) que.push({db, {beg+2, b+1}});
				else que.push({da, {a+1, end}});
			}
			else{
				que.push({d, {beg+2, end}});
			}
			beg=end;
			d=1;
		}
		else{
			d*=comp[i];
		}
	}
	end=n;
	if(end-beg<2){				
			que.push({0, {beg+1, end+1}});
		}
	if(d<0){
		int a=beg+1, b=end-1, da=d, db=d;
		while(da<0&&a<end){
			da/=comp[a];
			a++;
		}
		while(db<0&&b>beg){
			db/=comp[b];
			b--;
		}
		if(da<db) que.push({db, {beg+2, b+1}});
		else que.push({da, {a+1, end}});
	}
	else{
		que.push({d, {beg+2, end}});
	}
	cout<<que.top().second.first<<" "<<que.top().second.second;
}