#include <cstdio>

using namespace std;

const int N2=(1<<7)+5, N=8;

double d[N2][N], a[N2][N2];

int p[N2][N], n, n2;

int main() {

	for(int i=1; i<=128; ++i) p[i][1]=i-1;

	for(int i=1; i<=128; ++i) for(int j=2; j<=7; ++j) p[i][j]=p[i][j-1]>>1;

	while(scanf("%d", &n), ~n) {

		n2=1<<n;

		for(int i=1; i<=n2; ++i) for(int j=1; j<=n2; ++j) scanf("%lf", &a[i][j]);

		for(int i=1; i<=n2; ++i) d[i][0]=1;

		for(int j=1; j<=n; ++j) for(int i=1; i<=n2; ++i) {

			int pos=p[i][j]^1;

			double sum=0;

			for(int k=1; k<=n2; ++k) if(p[k][j]==pos)

				sum+=d[k][j-1]*a[i][k];

			d[i][j]=d[i][j-1]*sum;

		}

		int ans; double mx=-1;

		for(int i=1; i<=n2; ++i) if(d[i][n]>mx) { mx=d[i][n]; ans=i; }

		printf("%d\n", ans);

	}

	return 0;

}