玄关求调

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 114514;
int a[N], w[N];
int n;
void dfs(int x) {
    if (x >= (1 << n))
        return;
    dfs(2 * x);
    dfs(2 * x + 1);
    int ls = a[2 * x], rs = a[2 * x + 1];
    if (ls > rs) {
        a[x] = ls;
        w[x] = w[2 * x];
    }
    else {
        a[x] = rs;
        w[x] = w[2 * x + 1];
    }
    return;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 0; i < (1 << n); i ++) {
        cin >> a[i + (1 << n)];
        w[i + (1 << n)] = i + 1;
    }
    dfs(1);
    cout << (w[2] > w[3] ? w[3] : w[2]);
    return 0;
}