#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int main(void){
    int n;
    vector<int> s,t,ans;
    
    cin >> n;
    
    for(int v, i = 0; i < n; i++) { 
        cin >> v;
        s.push_back(v);
    }
    for(int v, i = 0; i < n; i++) {
        cin >> v;
        t.push_back(v);
    }
    vector<int> w(n);
    for(int v, i = 0; i < n; i++){
        v = s[i];
        w[v] = i;
    }
    
    int j = -1;
    for(int v, i = 0; i < n; i++){
        v = t[i];
        if(w[v] > j){
            ans.push_back(v);
            j = w[v];
        }
    }
    
    sort(ans.begin(), ans.end());
    for(vector<int>::iterator it = ans.begin(); it != ans.end(); it++){
        cout << *it <<endl;
    }
}