#include<iostream>
#include<algorithm>
using namespace std;
struct st{
	int num;
	int id;
}a[1005];
int cmp(st x,st y){
	return x.num>y.num;
}
int main(){
	int n;
	cin>>n;
	n=1<<n;
	for(int i = 1;i<=n;i++){
		cin>>a[i].num;
		a[i].id=i;
	}
	sort(a+1,a+n+1,cmp);
	if(a[1].num<a[n/2+1].num)cout<<a[1].id;
	else cout<<a[n/2+1].id;
} 

思路：找左右两边最强的，输出菜一些的那一个