#include <bits/stdc++.h>

#include "conveyor.h"

void Solve(int n, std::vector<int> A, std::vector<int> B) {
    std::vector<int> ans(n - 1, -1);

    while (true) {
        int it = std::find(ans.begin(), ans.end(), -1) - ans.begin();
        if (it == ans.size()) {
            break;
        }
        int u = A[it];
        std::vector<int> rev(n - 1);
        std::vector<int> put(n);
        put[u] = 1;
        for (int i = 0; i < n - 1; i++) {
            if (ans[i] != -1) {
                if ((ans[i] ? B[i] : A[i]) == u) {
                    rev[i] = 1;
                }
            }
        }
        auto res = Query(rev, put);
        int ind = std::find(res.begin(), res.end(), 1) - res.begin();
        if (ind == u) {
            for (int i = 0; i < n - 1; i++) {
                if (ans[i] == -1 && (A[i] == u || B[i] == u)) {
                    ans[i] = A[i] == u;
                }
            }
        } else {
            for (int i = 0; i < n - 1; i++) {
                if (ans[i] == -1 && (A[i] == u && B[i] == ind || A[i] == ind && B[i] == u)) {
                    ans[i] = A[i] == ind;
                }
            }
        }
    }

    Answer(ans);
}