#include <bits/stdc++.h>

using namespace std;

struct rec {
    int p, h;
    int id;
    bool operator<(const rec & r) const {
        if (p != r.p) return p < r.p;
        return h < r.h;
    }
};

int main() {
    int n;
    cin >> n;
    vector<rec> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].p;
        a[i].id = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> a[i].h;
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i].p;
        b[i].id = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i].h;
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    vector<int> ans(n);
    int j = 0;
    set<pair<int, int>> bh;
    for (int i = 0; i < n; i++) {
        if (bh.empty()) {
            int cur = b[j].p;
            while (j < n && b[j].p == cur) {
                bh.insert({b[j].h, b[j].id});
                j++;
            }
        }
        // Find the one lower than 
        auto it = bh.lower_bound({a[i].h, -1});
        if (it == bh.begin()) {
            cout << "impossible\n";
            return 0;
        }
        it--;
        ans[i] = it->second;
        bh.erase(it); 
    }
    for (int i = 0; i < n; i++) {
        cout << a[i].id + 1 << " ";
    }
    cout << endl;
    for (int i = 0; i < n; i++) {
        cout << ans[i] + 1 << " ";
    }
    cout << endl;
}