#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;

int num[100005], pos[100005], n;
bool f[100005];
vector<int> ans;

int main(void){
    cin >> n;

    for (int i = 0; i < n; i++){
        cin >> num[i];
        pos[num[i]] = i;
        f[i + 1] = true;
    }

    int pre = -1;

    for (int i = 0; i < n; i++){
        int s;
        cin >> s;
        if (!f[s]) continue;
        int p = pos[s] - 1;

        while (p != pre){
            f[num[p]] = false;
            p--;
        }
        ans.push_back(s);
        pre = pos[s];
    }

    sort(ans.begin(), ans.end());

    for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
}