#include <bits/stdc++.h>
#define endl '\n'

#define Endl endl

#define rt return

#define int long long

using namespace std;
const int mod = 998244353;
const int maxn = 1 << 22;
int a[maxn];
int maxx;
int n;
int dfs(int idx) {
    if (idx * 2 >= (1ll << (n + 1)))
        rt a[idx];
    if (idx * 2 < (1ll << (n + 1)) && a[idx * 2] == 0)
        dfs(idx * 2);
    if (idx * 2 + 1 < (1ll << (n + 1)) && a[idx * 2 + 1] == 0)
        dfs(idx * 2 + 1);
    a[idx] = max(a[idx * 2], a[idx * 2 + 1]);
    rt a[idx];
}
int dfn(int idx, int cnt = 0) {
    if (a[idx] == 1)
        rt cnt;
    if (idx * 2 >= (1ll << (n + 1)))
        rt cnt;
    else
        rt min(dfn(idx * 2, cnt + 1), dfn(idx * 2 + 1, cnt + 1));
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    int cnt = 0;
    maxx = n;
    for (int i = 1ll << n; i < (1ll << (n + 1)); i++) {
        int tp;
        cin >> a[i];
    }
    dfs(1);
    cout << "we are top " << (long long)pow(2ll, dfn(1)) << " !";
    rt 0;
}