#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;

signed main()
{
    ios_base::sync_with_stdio(false);
    int n;
    cin>>n;
    vector<int> a(n+5),b(n+5);
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int i=1;i<=n;i++)
    {
        cin>>b[i];
    }
    vector<vector<int>> G(n+5);
    vector<int> deg(n+5),pre(n+5);
    auto addedge=[&](int u,int v)
    {
//        cerr<<"addedge "<<u<<' '<<v<<endl;
        G[u].push_back(v);
        deg[v]++;
    };
    for(int i=1;i<=n;i++)
    {
        if(pre[a[i]])addedge(i,pre[a[i]]);
        if(pre[a[i]-1])addedge(pre[a[i]-1],i);
        pre[a[i]]=i;
    }
    fill(pre.begin(),pre.end(),0);
    for(int i=n;i>=1;i--)
    {
        if(pre[b[i]])addedge(i,pre[b[i]]);
        if(pre[b[i]-1])addedge(pre[b[i]-1],i);
        pre[b[i]]=i;
    }
    queue<int> q;
    vector<int> ans(n+5);
    for(int i=1;i<=n;i++)
    {
        if(deg[i]==0)q.push(i);
    }
    int idx=0;
    while(not q.empty())
    {
        int u=q.front();q.pop();
        ans[u]=++idx;
        for(auto v:G[u])
        {
            deg[v]--;
            if(deg[v]==0)q.push(v);
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<ans[i]<<" \n"[i==n];
    }
    return 0;
}