#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int N = 100000;
int n,fst[N+1],mx=-1;
vector<int> ans;

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		int v; cin >> v; fst[v] = i;
	}
	for (int i = 0; i < n; i++) {
		int v; cin >> v;
		if (mx < fst[v])ans.push_back(v);
		mx = max(fst[v], mx);
	}
	sort(ans.begin(), ans.end());
	for (int i = 0; i < ans.size(); i++)cout << ans[i] << endl;
	return 0;
}