#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

struct BIT {
    BIT(int n) : s(n + 1), n(n) {}
    int sum(int k) {
        int r = 0;
        for (; k > 0; k -= k & -k) r += s[k];
        return r;
    }
    void add(int i, int v) {
        for (int k = i + 1; k <= n; k += k & -k) s[k] += v;
    }
    vector<int> s;
    int n;
};

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

    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i]--;
    }

    vector<int> c(n);
    for (int i = 0; i < n; i++) {
        int b;
        cin >> b;
        b--;

        c[b] = i;
    }

    vector<int> r(n);
    BIT bit(n);
    for (int i = n - 1; i >= 0; i--) {
        int t = c[a[i]];
        if (bit.sum(t) == 0) r[a[i]] = 1;
        bit.add(t, 1);
    }

    for (int i = 0; i < n; i++) {
        if (r[i]) cout << i + 1 << '\n';
    }

    return 0;
}