import heapq

N = int(input())
A = tuple(map(int, input().split()))
B = map(int, input().split())
B_idx = {x: i for i, x in enumerate(B)}

h = [N + 1]
ans = []
for a in reversed(A):
    if B_idx[a] < h[0]:
        ans.append(a)
        heapq.heappush(h, B_idx[a])
ans.sort()
print(*ans, sep='\n')