import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 9; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

class BIT:
	def __init__(self, N):
		self.size = N
		self.tree = [0] * (N + 1)

	def sum(self, t):
		s = 0
		while t > 0:
			s += self.tree[t]
			t -= t & -t
		return s

	def add(self, t, x):
		while t <= self.size:
			self.tree[t] += x
			t += t & -t

#処理内容
def main():
	N = int(input())
	A = getlist()
	B = getlist()
	conv = [[A[i], i + 1] for i in range(N)]
	conv.sort()
	# print(conv)
	B2 = [conv[B[i] - 1][1] for i in range(N)]
	# print(B2)
	ans = []
	bit = BIT(N + 1)
	for i in range(N):
		bit.add(B2[i], 1)
		if bit.sum(B2[i]) == i + 1:
			ans.append(B[i])

	ans.sort()
	for i in ans:
		print(i)

if __name__ == '__main__':
	main()