#include<bits/stdc++.h>
using namespace std;

int winner[300],value[360],n;

void dfs(int x)
{
	if(x>=1<<n)
	{
		return ;
	}
	else{
		dfs(2*x);
		dfs(2*x+1);
		int lvalue=value[2*x];
		int 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=1;i<=1<<n;i++)
	{
		cin>>value[i+(1<<n)];
		winner[i+(1<<n)] = i;
	}
	dfs(1);
	int x=value[3]>value[4]?winner[4]:winner[3];
	cout<<x;
	return 0;
}