#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int sgn(int a) {
    if (a > 0) return 1;
    else if (a == 0) return 0;
    else return -1;
}

int main() {
    int db;
    cin >> db;

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

    vector<int> parH(db, 0);
    vector<int> parE(db, 0);
    vector<int> osszeg(db, 0);

    for (int i = db - 1; i >= 1; i--) {
        for (int j = i - 1; j >= 0; j--) {
            osszeg[j] = eredeti[i] +
                        sgn(eredeti[i] - eredeti[j]) * eredeti[j];
        }

        parE[i] = *max_element(osszeg.begin(), osszeg.begin() + i);
        parH[i] = distance(
            osszeg.begin(),
            find(osszeg.begin(), osszeg.begin() + i, parE[i])
        );
    }

    int maxParE = *max_element(parE.begin() + 1, parE.end());

    if (maxParE == -1) {
        cout << "0 0" << endl;
    } else {
        int ajandek2 = distance(
            parE.begin(),
            max_element(parE.begin(), parE.end())
        );
        int ajandek1 = parH[ajandek2];
        cout << ajandek1 + 1 << " " << ajandek2 + 1 << endl;
    }

    return 0;
}