#include<bits/stdc++.h>
using namespace std;
long long n,winner[300],value[300];
void dfs(int x)
{
	if(x>= 1<< n) return;
	else {
		dfs(2*x);
		dfs(2*x+1);
		int lvalue=value[2*n],rvalue=value[2*x+1];
		if(lvalue>rvalue) {
			value[x]=lvalue;
			winner[x]=winner[2*x];
		}
		else 
		{	value[x]=rvalue;
			winner[x]=winner[2*x+1];
		}
	}
}
int main()
{
	cin>>n;
	for(int i=0;i< 1<<n;i++)
	{
		cin>>value[i+(i<<n)];
		winner[i+(1<<n)]=i+1;
	}
	dfs(1);
	if(value[2]>value[3]) cout<<winner[3];
	else cout<<winner[2];
	return 0;
}