#include <iostream>

using namespace std;

int val[100001];

void getNextZeroIndex(int &startIndex, int &endIndex, int &nrNegative, int N)
{
    nrNegative = 0;
    while(startIndex < N && val[startIndex] == 0){
        startIndex++;
    }
    endIndex = startIndex;
    while(endIndex < N && val[endIndex] != 0){
        if(val[endIndex] < 0){
            nrNegative++;
        }
        endIndex++;
    }
    endIndex--;
}

long long multiply(int startIndex, int endIndex, int N)
{
    if(startIndex > endIndex){
        return 0;
    }
    long long res = 1;
    for(int i = startIndex; i < N && i <= endIndex; i++){
        res = res * val[i];
    }
    return res;
}

int getFirstNegative(int startIndex, int endIndex, int N)
{
    for(int i = startIndex; i <= endIndex; i++){
        if(val[i] < 0){
            return i;
        }
    }
    return N;
}

int getLastNegative(int startIndex, int endIndex, int N)
{
    for(int i = endIndex; i >= startIndex; i--){
        if(val[i] < 0){
            return i;
        }
    }
    return N;
}

int main()
{
    int N;
    cin >> N;
    for(int i = 0; i < N; i++){
        cin >> val[i];
    }
    long long result = -1;
    int resultIndex1, resultIndex2;
    int startIndex = 0, endIndex = 0, nrNegative;

    while(startIndex < N){
        getNextZeroIndex(startIndex, endIndex, nrNegative, N);
        if(nrNegative % 2 == 0){
            long long p = multiply(startIndex, endIndex, N);
            if(p > result){
                result = p;
                resultIndex1 = startIndex;
                resultIndex2 = endIndex;
            }
        }
        else{
            int firstNegative = getFirstNegative(startIndex, endIndex, N);
            int lastNegative = getLastNegative(startIndex, endIndex, N);
            long long p1 = multiply(firstNegative+1, endIndex, N);
            long long p2 = multiply(startIndex, lastNegative-1, N);
            if(p1 > result){
                result = p1;
                resultIndex1 = firstNegative+1;
                resultIndex2 = endIndex;
            }
            if(p2 > result){
                result = p2;
                resultIndex1 = startIndex;
                resultIndex2 = lastNegative-1;
            }
        }
        startIndex = endIndex+1;
    }
    cout << resultIndex1 + 1 << " " << resultIndex2 + 1<< endl;
    return 0;
}