#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
#define if0(x) for (int64_t i = 0; i < x; i++)

#define jf0(x) for (int j = 0; j < x; j++)

#define if1(x) for (int i = 1; i <= x; i++)

#define jf1(x) for (int j = 1; j <= x; j++)


int64_t qpow(int64_t a, int64_t n) {
    int64_t ans = 1;
    while (n) {
        if (n & 1) {
            ans = ans * a;
        }
        a = a * a;
        n >>= 1;
    }
    return ans;
}
void solve() {
    int64_t n;
    int64_t tmp, ans = 0;
    cin >> n;
    // int64_t round=qpow(2, n);
    if0(2 << (n - 1))
    // if0(round)
    {
        cin >> tmp;
        if (tmp > 1)
            ans++;
    }
    if (ans == 0) {
        cout << "we are top " << 1 << " !";
        return;
    }
    int64_t ans2 = 0;
    // cout<<"ans"<<ans;
    while (ans > 0) {
        ans /= 2;
        ans2++;
    }
    // int64_t ans3=qpow(2, ans2);
    // char a='0'+ans3;

    cout << "we are top " << (2 << (ans2 - 1)) << " !";
    return;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }
    return 0;
}