#include<bits/stdc++.h>

using namespace std;

int space[1<<7+1];

int dfs(int l,int r){//[l,r)
	if(r-l==1){
		return l;
	}
	
	int mid=l+(r-l)/2;
	int L=dfs(l,mid);
	int R=dfs(mid,r);
	
	if(space[L]>space[R]){
		return L;
	}
	
	return R; 
}

int main(){
	int n;
	cin>>n;
	for(int i=0;i<(1<<n);i++){
		cin>>space[i];
	}
	int mid=(1<<n)/2;
	
	int scd=min(dfs(0,mid), dfs(mid,(1<<n)) );
	
	cout<<scd+1;
	
	return 0;
}