#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 2e3 + 9, MOD = 998244353;


void doWork() {
    int n;
    cin >> n;
    vector<vector<int>> a(n, vector<int>(3)), b(n, vector<int>(3));
    for (int i = 0; i < n; i++) {
        cin >> a[i][0];
        a[i][2] = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> a[i][1];
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i][0];
        b[i][2] = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i][1];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int p1 = 0, p2 = 0;
    set<pair<int, int> > s1, s2;
    vector<int> ans_a, ans_b;

    while (p1 < n || p2 < n) {
        if (s1.empty()) {
            s1.insert({a[p1][1], a[p1][2]});
            p1++;
            while (p1 < n && a[p1 - 1][0] == a[p1][0]) {
                s1.insert({a[p1][1], a[p1][2]});
                p1++;
            }
        }
        if (s2.empty()) {
            s2.insert({b[p2][1], b[p2][2]});
            p2++;

            while (p2 < n && b[p2 - 1][0] == b[p2][0]) {
                s2.insert({b[p2][1], b[p2][2]});
                p2++;
            }
        }

        if (s1.size() < s2.size()) {
            for (auto i: s1) {
                auto it = s2.lower_bound(make_pair(i.first, -1));
                if (it == s2.begin()) {
                    cout << "impossible";
                    return;
                }
                it--;
                ans_a.push_back(i.second);
                ans_b.push_back(it->second);
                s2.erase(it);
            }
            s1.clear();
        } else {
            for (auto i: s2) {
                auto it = s1.lower_bound(make_pair(i.first + 1, -1));
                if (it == s1.end()) {
                    cout << "impossible";
                    return;
                }
                ans_a.push_back(it->second);
                ans_b.push_back(i.second);
                s1.erase(it);
            }
            s2.clear();
        }
    }
    for (auto i: ans_a)cout << i + 1 << " ";
    cout << "\n";
    for (auto i: ans_b)cout << i + 1 << " ";
}

int main() {

    IO
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}