#include<bits/stdc++.h> 
using namespace std;
int va[260],wr[260];
int n;
void dfs(int x)
{
	if(x>=1<<n)
	{
		return;
	}
	else 
	{
		dfs(2*x);
		dfs(2*x+1);
		int lv=va[2*x],rv=va[2*x+1];
		if(lv>rv)
		{
			va[x]=lv;
			wr[x]=wr[x*2];
		}
		else
		{
			va[x]=rv;
			wr[x]=wr[2*x+1];
		}
	}
}
int main()
{
	cin>>n;
	for(int i=0;i<1<<n;i++)
	{
		cin>>wr[i+(1<<n)];
		wr[i+(1<<n)]=i+1; 
	}
	dfs(1);
	cout<<((va[2] > va[3]) ? wr[3] :wr[2]); 
	return 0;
}