#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 n;
int s[100005];
int g[100005];
vector<int> v[100005],ans;
int main(void){
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> s[i];
        s[i]--;
        v[s[i]].push_back(i);
    }
    for (int i = 0; i < n; i++){
        cin >> g[i];
        g[i]--;
        v[g[i]].push_back(i);
    }

    for (int i = 0; i < n; i++){
        bool flag = true;
        for (int j = 0; j < n; j++){
            if (v[i][0]<v[j][0] && v[i][1]>v[j][1]) flag = false;
        }
        if (flag) ans.push_back(i);
    }

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

}