#include<bits/stdc++.h>
using namespace std;
mt19937 mt(time(NULL));
constexpr int M=(1<<20)+5;
int n,lim,limit,a[M],id[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x; 
}
int main(){ n=read();lim=1<<n;
	for (int i=0;i<lim;i++) a[i]=read();
	auto solve=[&](auto x,auto y)->void {
		if (a[x]+a[y]<a[x&y]+a[x|y]){
			printf("%d %d\n",x,y);exit(0);
		}
	};
	for (int i=0;i<lim;i++)
		for (int j=1;j<lim;j<<=1){ 
			solve(i,j),solve(i,i^j);
			for (int k=j<<1;k<lim;k<<=1)
				solve(i,j^k);
		}
	iota(id,id+lim,0);
	sort(id,id+lim,[&](int x,int y){return a[x]<a[y];});
	for (int i=0;i<lim&&i<2048;i++){
		if (i<16) limit=lim;
		else limit=min(1024,lim);
		for (int j=i+1;j<limit;j++)
			solve(id[i],id[j]);
		}
	reverse(id,id+lim);
	for (int i=0;i<lim&&i<2048;i++){
		if (i<16) limit=lim;
		else limit=min(1024,lim);
		for (int j=i+1;j<limit;j++)
			solve(id[i],id[j]);
		}
	int T=2048*2048;
	while (T--) solve(mt()%lim,mt()%lim);
	return puts("-1"),0;
}