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

using namespace std;

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);

    bool vanelottekisebb = false;

    for (int i = db - 1; i >= 1; i--) {
        vector<int> mxkeresE;
        vector<int> mxkeresH;

        for (int j = i - 1; j >= 0; j--) {
            if (eredeti[i] > eredeti[j]) {
                vanelottekisebb = true;
                mxkeresE.push_back(eredeti[i] + eredeti[j]);
                mxkeresH.push_back(j);

                parE[i] = *max_element(mxkeresE.begin(), mxkeresE.end());
                parH[i] = mxkeresH[
                    distance(mxkeresE.begin(),
                             find(mxkeresE.begin(), mxkeresE.end(), parE[i]))
                ];
            }
        }
    }

    if (!vanelottekisebb) {
        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;
}