#include<bits/stdc++.h> using namespace std; int n; struct BYX{ int id; int pow; }a,b; bool cmp (BYX n,BYX m){ return n.pow<m.pow; } queue q; int main(){ scanf("%d",&n); for(int i=1;i<=(1<<n);i++){ scanf("%d",&a.pow); a.id=i; q.push(a); } while(q.size()>1){ a=q.front(); q.pop(); b=q.front(); q.pop(); q.push(max(a,b,cmp));

}
printf("%d",min(a,b,cmp).id);
return 0;

}