#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=201000;
int n,a[N],deg[N],b[N],ret[N],v[N];
VI e[N];
queue<int> q;

void add(int x,int y) {
	e[x].pb(y);
	//printf("cnm %d < %d\n",x,y);
	deg[y]++;
}
int main() {
	scanf("%d",&n);
	rep(i,1,n+1) {
		scanf("%d",&a[i]);
		if (v[a[i]]!=0) add(i,v[a[i]]); // i <
		if (a[i]>1) add(v[a[i]-1],i);
		v[a[i]]=i;
	}
	rep(i,1,n+1) scanf("%d",&b[i]),v[i]=0;
	per(i,1,n+1) {
		if (v[b[i]]!=0) add(i,v[b[i]]); // i <
		if (b[i]>1) add(v[b[i]-1],i);		
		v[b[i]]=i;
	}
	rep(i,1,n+1) if (deg[i]==0) {
		q.push(i);
	}
	int tot=0;
	while (!q.empty()) {
		int u=q.front(); ret[u]=++tot;
		q.pop();
		for (auto v:e[u]) {
			--deg[v];
			if (deg[v]==0) q.push(v);
		}
	}
	rep(i,1,n+1) printf("%d ",ret[i]); puts("");
}