#include #define rep(i, a, n) for(int i = a; i < n; i++) #define REP(i, n) rep(i, 0, n) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define int long long #define chmax(x, y) x = max(x, y) #define chmin(x, y) x = min(x, y) using namespace std; typedef pair P; const int mod = 1000000007; const int INF = 1e12; signed main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector a(n), b(n); rep(i, 0, n){ cin >> a[i]; a[i]--; } rep(i, 0, n){ cin >> b[i]; b[i]--; } vector ans; vector f(n); int idx = n - 1; repb(i, n - 1, 0){ if(idx < 0) break; while(f[a[idx]]){ idx--; } if(b[i] == a[idx]){ ans.push_back(a[idx] + 1); idx--; } f[b[i]] = true; } sort(all(ans)); for(int ii = 0; ii < ans.size(); ii++){ cout << ans[ii] << endl; } }