#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
using namespace std;
typedef long long int ll;
using ull = unsigned long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> a(n),b(n);
    vector<int> v;
    map<int,int> mp;
    for(int i=0;i<n;i++){
        cin >> a[i];
        mp[a[i]]=i;
    }
    int mx=-1;
    for(int i=0;i<n;i++){
        cin >> b[i];
        if(mx<mp[b[i]])v.push_back(b[i]);
        mx=max(mx,mp[b[i]]);
    }
    sort(v.begin(), v.end());
    for(int vv:v){
        printf("%d\n",vv);
    }
}