AT_abc188_c
#include <iostream>
#include <cstring>
#include <cmath>
#define int long long
using namespace std;
int n,a[1024*1024],p,l[1024*1024];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n;
p=pow(2,n);
for(int i=1;i<=p;++i){
cin>>a[i];
l[i]=a[i];
}
while(p!=2){
int k[p+10],ip=0;
for(int i=1;i<=p;i+=2){
k[++ip]=max(a[i],a[i+1]);
}
memset(a,0,sizeof(a));
p/=2;
for(int i=1;i<=p;++i){
a[i]=k[i];
}
}
int ans=min(a[1],a[2]);
p=pow(2,n);
for(int i=1;i<=n;++i){
if(l[i]==ans){
cout<<i<<" ";
break;
}
}
return 0;
}