#include<iostream>
#include<stdio.h>
#include "namuhs.cpp"
using namespace std;
int a_gr[1000001],n_gr;
bool compare_segments (int left1, int right1, int left2, int right2) {
    if ((left1>right1)||(left2>right2)||(left1<1)||(right1>n_gr)||(left2<1)||(right2>n_gr)) return true;
    long long int sum1=0,sum2=0,i;
    for (i=left1-1; i<right1; i++) {
        sum1+=a_gr[i];
        }
    for (i=left2-1; i<right2; i++) {
        sum2+=a_gr[i];
        }
    return (sum1>=sum2);
}
int main () {
    long long int i;
    int left,right;
    scanf("%d",&n_gr);
    for (i=0; i<n_gr; i++) {
        scanf("%d",&a_gr[i]);
        }
    find_max(n_gr,left,right);
    printf("%d %d",left,right);
    cout << endl ;
    return 0;
}
