LEVELS

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

const int N = 20;

int n, m;
vector<pair<int, int> > a;

int main() {
#ifdef DN
    //freopen("in.txt", "r", stdin);
#endif
    freopen("LEVELS.inp", "r", stdin);
    freopen("LEVELS.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    cin >> n;
    m = 1 << n;
    for(int i = 0; i < m; ++i) {
        int x; cin >> x;
        a.push_back({x, i});
    }
    sort(a.begin(), a.end());

    vector<int> ans(m, n);

    int sizes = m - 1;
    int level = 0;
    int tmp = a[sizes].first;

    while(true) {
        while(sizes >= 0 && a[sizes].first == tmp) {
            ans[a[sizes--].second] = level;
        }

        if(sizes <= 0) break;

        tmp = a[sizes].first;
        int p = sizes + 1;

        for(int i = n - 1; i >= 0; --i) {
            if(p >> i & 1) {
                level = n - i;
                break;
            }
        }
    }

    for(int i = 0; i < m; ++i)
        cout << ans[i] << ' ';

    return 0;
}