Snowman

The snowman-making event at the Pyeongchang Winter Olympics has started! In this event, the person who builds the biggest snowman within the given time wins.

Ari turned on the broadcast when the event had only just started. The broadcast was showing the leaderboard, a table that lists each player's bib number in rank order. Ari memorized the bib numbers on the leaderboard in order.

Ari stepped away for a moment, and the event ended. Given the leaderboard at the end of the event, find the bib numbers of the players whose rank rose the most compared to the ranks Ari remembered.

The first line contains the number of players $N$.

The second line contains $N$ integers $A_1, \cdots, A_N$, the bib numbers of each player in rank order when Ari turned on the broadcast, separated by spaces.

The third line contains $N$ integers $B_1, \cdots, B_N$, the bib numbers of each player in rank order at the end of the event, separated by spaces.

Print the bib numbers of the players whose rank rose the most, in the order of their rank at the end of the event, separated by spaces.

• $1 \le N \le 100\,000$
• $1 \le A_i \le 1\,000\,000\,000$
• $1 \le B_i \le 1\,000\,000\,000$
• All $A_i$ are distinct. ($i \neq j \rightarrow A_i \neq A_j$)
• All $B_i$ are distinct. ($i \neq j \rightarrow B_i \neq B_j$)
• The set of elements of array $A$ is the same as the set of elements of array $B$.