#ifndef LOCAL
    #include "cave.h"
#endif
#include <bits/stdc++.h>

using namespace std;

vector<int> s, d;

#ifdef LOCAL 
    int tryCombination(int A[]) {
        cout << "ask ";
        for (int i = 0; i < s.size(); i++) cout << A[i] << ' ';
        cout << '\n';
        vector<int> status(s.size());
        for (int i = 0; i < s.size(); i++) {
            status[d[i]] = (A[i] == s[i] ? 1 : 0);
        }
        for (int i = 0; i < s.size(); i++) {
            if (!status[i]) return i;
        }
        return -1;
    }

    void answer(int S[], int D[]) {
        cout << "answer is: \n";
        for (int i = 0; i < s.size(); i++) cout << S[i] << ' ';
        cout << '\n';
        for (int i = 0; i < s.size(); i++) cout << D[i] << ' ';
        cout << '\n';
    }
#endif

void exploreCave(int N) {
    int n = N;
    int to_ask[n], d[n];
    vector<int> used(n, 0);
    // used[i] = 1 means that turn i already belongs to some door lefter that current one

    for (int i = 0; i < n; i++) {
        vector<int> ps;
        for (int j = 0; j < n; j++) {
            if (!used[j]) {
                ps.push_back(j);
                to_ask[j] = 0;
            }
        }
        int asw = tryCombination(to_ask);
        int trg = 0;
        if (asw == i) trg = 1;
        else {
            for (int u : ps) to_ask[u] = 1;
        }
        // trg is sign when ith door opened
        pair<int, int> curseg = {0, ps.size()};
        while (curseg.second - curseg.first > 1) {
            int mid = (curseg.first + curseg.second) >> 1;
            for (int j = curseg.first; j < mid; j++) to_ask[ps[j]] = trg;
            asw = tryCombination(to_ask);
            for (int j = curseg.first; j < mid; j++) to_ask[ps[j]] = !trg;
            if (asw == i) {
                curseg.first = mid;
            } else curseg.second = mid;
        }
        d[ps[curseg.first]] = i;
        used[ps[curseg.first]] = 1;
        to_ask[ps[curseg.first]] = trg;
    }
    answer(to_ask, d);
}


#ifdef LOCAL 
    signed main() {
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        int n; cin >> n;
        s.assign(n, 0); d.assign(n, 0);
        for (int i = 0; i < n; i++) cin >> s[i];
        for (int i = 0; i < n; i++) cin >> d[i];
        exploreCave(n);
        return 0;
    }
#endif