#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

void solve() {

	ll n;
	cin >> n;

	vector<ll> v(n+1, 0);
	
	if(n <= 100) {
		
		ll mx = 0;
		ll a = -1, b = -1;

		vector<pair<ll,pair<ll,ll>>> p;

		for(ll i = 1; i <= n; i++) {
			cin >> v[i];

			for(ll j = i - 1; j >= 1; j--) {
				if(v[j] >= v[i]) {
					continue;
				}

				p.push_back({v[i] + v[j], {j, i}});

			}
		}

		if(p.empty()) {
			cout << "0 0";
			return;
		}

		sort(p.rbegin(), p.rend());

		cout << p[0].second.first << " " << p[0].second.second;
		
		return;
	}

	set<ll> s;
	ll mx = 0;
	ll a = -1, b = -1;
	for(ll i = 1; i <= n; i++) {
		cin >> v[i];			

		//cerr << "\ni=" << i << "; s=" << s;
		if(s.empty()) {
			s.insert(v[i]);
			continue;
		}
		if(v[i] <= *s.begin()) {
			s.insert(v[i]);
			continue;
		}

		ll best = *prev(s.lower_bound(v[i]));
		//cerr << "\nv[i]=" << v[i] << "; best=" << best;
		if(v[i] + best > mx) {
			mx = v[i] + best;
			a = best;
			b = i;
		}

		s.insert(v[i]);
	}	

	if(a == -1 && b == -1) {
		cout << "0 0";
		return;
	}

	for(ll i = 1; i <= n; i++) {
		if(v[i] == a) {
			a = i;
			break;
		}
	}

	cout << a << " " << b;

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}