#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int M=2e6+10;
int n,lim,a[M];
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=read(); lim=(1<<n)-1;
	F(i,0,lim) a[i]=read();
	F(i,0,lim){
		F(j,0,n-1){
			if (i>>j&1) continue;
			F(k,j+1,n-1){
				if (i>>k&1) continue;
				int lp=a[i|(1<<j)]+a[i|(1<<k)],rp=a[i|(1<<j)|(1<<k)]+a[i];
				if (lp<rp){
					cout<<(i|(1<<j))<<" "<<(i|(1<<k))<<"\n";
					return 0;
				}
			}
		}
	}
	puts("-1");
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/