#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';

void solve() {
    int N; cin >> N;
    vector<array<int, 3>> A[2];
    F0R(i, 2) {
        A[i] = vector<array<int, 3>>(N);
    }
    F0R(i, 2) {
        F0R(j, N) {
            cin >> A[i][j][0];
        }
        F0R(j, N) cin >> A[i][j][1];
        F0R(j, N) A[i][j][2] = j+1;
        sort(all(A[i]));
    }
    set<pi> cur[2];
    vi ans[2];
    F0R(i, N) {
        F0R(j, 2) {
            if (sz(cur[j]) == 0) {
                FOR(k, i, N) {
                    if (A[j][k][0] != A[j][i][0]) break;
                    cur[j].ins({A[j][k][1], A[j][k][2]});
                }
            }
        }

        if (sz(cur[0]) <= sz(cur[1])) {
            // back row
            pi v = *cur[0].begin();
            cur[0].erase(v);
            auto it = cur[1].lb({v.f, -1});
            if (it == cur[1].begin()) {
                cout << "impossible" << nl; return;
            }
            ans[0].pb(v.s);
            it--;
            ans[1].pb(it->s);
            cur[1].erase(it);
        } else {
            pi v = *cur[1].begin(); cur[1].erase(v);
            auto it = cur[0].lb({v.f+1, -1});
            if (it == cur[0].end()) {
                cout << "impossible" << nl; return;
            }
            ans[1].pb(v.s);
            ans[0].pb(it->s);
            cur[0].erase(it);
        }
    }
    F0R(i, 2) {
        F0R(j, N) {
            cout << ans[i][j] << " ";
        }
        cout << nl;
    }
}


int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	solve();
	return 0;
}