#include <bits/stdc++.h>
const int N = 2e5;
int n, a[N + 5], b[N + 5], las[N + 5], ans[N + 5], in[N + 5];
std::vector<int> v[N + 5];
std::stack<int> sta;
std::vector<int> seq;
int main() {
    std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0);
    std::cin >> n;
    for (int i = 1; i <= n; ++i) std::cin >> a[i];
    for (int i = 1; i <= n; ++i) std::cin >> b[i];
    for (int i = 1; i <= n; ++i) {
        while (sta.size() and a[sta.top()] >= a[i]) v[i].push_back(sta.top()), sta.pop();
        sta.push(i);
        if (a[i] > 1) v[las[a[i] - 1]].push_back(i);
        las[a[i]] = i;
    }
    while (sta.size()) sta.pop();
    for (int i = 1; i <= n; ++i) las[i] = 0;
    for (int i = n; i; --i) {
        while (sta.size() and b[sta.top()] >= b[i]) v[i].push_back(sta.top()), sta.pop();
        sta.push(i);
        if (b[i] > 1) v[las[b[i] - 1]].push_back(i);
        las[b[i]] = i;
    }
    for (int i = 1; i <= n; ++i) for (auto j : v[i]) ++in[j];
    seq.push_back(0);
    for (int i = 1; i <= n; ++i) if (!in[i]) seq.push_back(i);
    for (int i = 1; i <= n; ++i) {
        int p = seq[i];
        for (auto j : v[p]) {
            --in[j];
            if (!in[j]) seq.push_back(j);
        }
    }
    for (int i = 1; i <= n; ++i) ans[seq[i]] = i;
    for (int i = 1; i <= n; ++i) std::cout << ans[i] << " \n"[i == n];
    return 0;
}