#include<iostream>
#include<cstdio>
#define N 20
#define inf 1e9
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum; 
}
int n,A[1<<N],dp[1<<N],F[1<<N],G[1<<N];
int main()
{
	n=read();
	for (int i=0;i<(1<<n);++i) A[i]=read();
	for (int i=0;i<n;++i)
	{
		for (int j=0;j<(1<<n);++j) F[j]=G[j]=(j&(1<<i))?A[j]-A[j^(1<<i)]:inf;
		for (int j=0;j<n;++j)
			for (int k=0;k<(1<<n);++k)
				if (k&(1<<j))
					G[k]=min(G[k],G[k^(1<<j)]);
		for (int j=0;j<(1<<n);++j)
			if (G[j]<F[j])
			{
				for (int k=0;k<(1<<n);++k)
					if ((k&j)==k&&F[k]<F[j])
						printf("%d %d\n",k,j^(1<<i));
				return 0;
			}
	}
	puts("-1");
	return 0;
}