#include<bits/stdc++.h>
using namespace std;
const int MAXN=5e5+1;
struct node {
	int q,h,id;
	inline friend bool operator <(const node &A,const node &B) {
		if(A.h==B.h) return A.id<B.id;
		return A.h<B.h;
	}
	node(int _q=0,int _h=0,int _id=0): q(_q),h(_h),id(_id) {}
}	a[MAXN],b[MAXN];
int s[MAXN],t[MAXN];
set <node> A,B;
map <int,vector<node>> C,D;
signed main() {
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d",&a[i].q),a[i].id=i;
	for(int i=1;i<=n;++i) scanf("%d",&a[i].h),C[a[i].q].push_back(a[i]);
	for(int i=1;i<=n;++i) scanf("%d",&b[i].q),b[i].id=i;
	for(int i=1;i<=n;++i) scanf("%d",&b[i].h),D[b[i].q].push_back(b[i]);
	auto it1=C.begin(),it2=D.begin();
	for(int i=1;i<=n;++i) {
		if(A.empty()) {
			for(auto x:it1->second) A.insert(x);
			++it1;
		}
		if(B.empty()) {
			for(auto x:it2->second) B.insert(x);
			++it2;
		}
		if(A.size()<B.size()) {
			auto x=A.begin();
			auto y=B.upper_bound(node(0,x->h-1,n+1));
			if(y==B.begin()) { puts("impossible"); return 0; }
			--y;
			s[i]=x->id,t[i]=y->id;
			A.erase(x),B.erase(y);
		} else {
			auto y=B.begin();
			auto x=A.lower_bound(node(0,y->h+1,0));
			if(x==A.end()) { puts("impossible"); return 0; }
			s[i]=x->id,t[i]=y->id;
			A.erase(x),B.erase(y);
		}
	}
	for(int i=1;i<=n;++i) printf("%d ",s[i]); puts("");
	for(int i=1;i<=n;++i) printf("%d ",t[i]); puts("");
	return 0;
}