//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = -1, inf = 1000111222;


inline void test_case () {
    int n;
    cin >> n;
    vector <int> a(n + 1), v(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    vector <int> ans(n + 1);
    for (int i = n; i > 0; i--) {
        int x = i;
        int cnt[2] = {};
        vector <int> path;
        while (x > 1 && a[x] != v[i]) {
            ++cnt[a[x] < v[i]];
            path.pb(x);
            x /= 2;
        }
        if (a[x] != v[i]) {
            cout << "Impossible\n";
            return;
        }
        if (x > 1 && a[x / 2] != v[i]) {
            ++cnt[a[x / 2] < v[i]];
        }
        if (cnt[0] && cnt[1]) {
            cout << "Impossible\n";
            return;
        }
        if (!cnt[0] && !cnt[1]) {
            continue;
        }
        int must = 0;
        if (cnt[1]) {
            must = 1;
        }
        reverse(all(path));
        for (int ver : path) {
            swap(a[ver], a[x]);
            LOG(x, ver);
            x = ver;
//            cout << ver << ' ';
        }
        LOG("end");
//        cout << '\n';
        ans[i] = must;
//        for (int j = 1; j <= n; j++) {
//            cout << a[j] << ' ';
//        }
//        cout << '\n';
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i];
    }
    cout << '\n';
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    for (int test = 1; test <= t; test++) {
        test_case();
    }
}