using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using AtCoder;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var b = NList;
        var bpos = new int[n];
        for (var i = 0; i < n; ++i) bpos[b[i] - 1] = i;
        var ft = new FenwickTree<int>(n + 1);
        var ans = new List<int>();
        for (var i = n - 1; i >= 0; --i)
        {
            var bi = bpos[a[i] - 1];
            if (ft.Sum(bi) == 0) ans.Add(a[i]);
            ft.Add(bi, 1);
        }
        ans.Sort();
        WriteLine(string.Join("\n", ans));
    }
}