/* Problem URL: https://codeforces.com/gym/106159/problem/G */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 0

void solve()
{
    int n;
    cin >> n;

    vl a(n);
    vi p(n);
    cin >> a >> p;

    vvi graph(n);
    rep(i, n) {
        int u = i;
        int v = p[i] - 1;
        if (a[u] > a[v]) {
            swap(u, v);
        }

        graph[u].push_back(v);
    }

    // vi group(n);
    // V<bool> vis(n);
    // V<bool> act(n);
    // vi rem;
    // vi add;
    // vi size;
    // int g = -1;
    //
    // int total = 0;
    //
    // function<void(int)> dfs = [&](int i) {
    //     act[i] = true;
    //     vis[i] = true;
    //     group[i] = g;
    //     add[g]++;
    //     size[g]++;
    //
    //     repv(j, graph[i]) {
    //         if (vis[j]) {
    //             continue;
    //         }
    //
    //         dfs(j);
    //     }
    // };
    //
    // rep(i, n) {
    //     if (vis[i]) {
    //         continue;
    //     }
    //
    //     g++;
    //     rem.emplace_back();
    //     add.emplace_back();
    //     size.emplace_back();
    //     dfs(i);
    //     total += size[g] >> 1;
    // }

    V<bool> activated(n);

}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}