#include<bits/stdc++.h>
using namespace std;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pii pair<int, int>
#define tii tuple<int, int, int>

#define N 500007

int p[N], ansb[N], anss[N];

tii b[N], s[N];

set<pii> B, S;

int main() {
	int n = rd();
	for (int i = 1; i <= n; ++i) p[i] = rd();
	for (int i = 1; i <= n; ++i) b[i] = mt(p[i], rd(), i);
	sort(b + 1, b + 1 + n);
	for (int i = 1; i <= n; ++i) p[i] = rd();
	for (int i = 1; i <= n; ++i) s[i] = mt(p[i], rd(), i);
	sort(s + 1, s + 1 + n);
	int tot = 0;
	for (int ptrs = 0, ptrb = 0; ptrs < n || ptrb < n;) {
		if (ptrs > ptrb) {
			++ptrb; 
			B.insert(mp(get<1>(b[ptrb]), get<2>(b[ptrb])));
			while (ptrb < n && get<0>(b[ptrb]) == get<0>(b[ptrb + 1])) {
				++ptrb; B.insert(mp(get<1>(b[ptrb]), get<2>(b[ptrb])));
			}
		} else if (ptrs < ptrb) {
			++ptrs; 
			S.insert(mp(get<1>(s[ptrs]), get<2>(s[ptrs])));
			while (ptrs < n && get<0>(s[ptrs]) == get<0>(s[ptrs + 1])) {
				++ptrs; S.insert(mp(get<1>(s[ptrs]), get<2>(s[ptrs])));
			}
		} else {
			++ptrb; 
			B.insert(mp(get<1>(b[ptrb]), get<2>(b[ptrb])));
			while (ptrb < n && get<0>(b[ptrb]) == get<0>(b[ptrb + 1])) {
				++ptrb; B.insert(mp(get<1>(b[ptrb]), get<2>(b[ptrb])));
			}
			++ptrs; 
			S.insert(mp(get<1>(s[ptrs]), get<2>(s[ptrs])));
			while (ptrs < n && get<0>(s[ptrs]) == get<0>(s[ptrs + 1])) {
				++ptrs; S.insert(mp(get<1>(s[ptrs]), get<2>(s[ptrs])));
			}
		}
    
		if (ptrs <= ptrb) {
			for (auto [h, id] : S) {
				if (h >= (*--B.end()).first) {puts("impossible"); return 0;}
				anss[++tot] = id; ansb[tot] = (*B.upper_bound(mp(h, 1e9))).second;
				B.erase(B.upper_bound(mp(h, 1e9))); 
			}
			S.clear();
		} else {
			for (auto [h, id] : B) {
				if (h <= (*S.begin()).first) {puts("impossible"); return 0;}
				ansb[++tot] = id; anss[tot] = (*--S.lower_bound(mp(h, 0))).second;
				S.erase(--S.lower_bound(mp(h, 0)));
			}
			B.clear();
		}
	}
	for (int i = 1; i <= n; ++i) printf("%d ", ansb[i]); puts("");
	for (int i = 1; i <= n; ++i) printf("%d ", anss[i]);
	return 0;
}