Problem C
Pawn Shop

You run a tight ship at the pawn shop. You arrange certain items in the window to be displayed to the street. You sometimes display the same type of item multiple times. For simplicity, we think of the items on display as a sequence of values where the value represents the type of item being shown.

For example, your display could be this sequence:

After coming back from your latest vacation, you find that your staff has completely rearranged the display by moving items around. Yikes! For example, the display above could be rearranged to:

You fear this could be the cause of confusion and may scare off repeat customers. But you don’t have time to move items back to their original positions.

As a compromise, you will put dividers up in the window to partition the displayed items into groups of consecutive items. Each group should be a rearrangement of the types of items that were in those positions in your preferred arrangement.

More precisely, let $a_1, \ldots , a_ N$ denote the first sequence and $b_1, \ldots , b_ N$ denote the second sequence. You may place dividers around $i, i+1, \ldots , j$ if $b_ i, b_{i+1}, \ldots , b_ j$ is a rearrangement of $a_ i, a_{i+1}, \ldots , a_ j$. You do not need to put a divider at the beginning or end of the sequence. Note, if $a_ i = b_ i$ then a group may be formed using just this single index $i$.

With the sequences above, you could place dividers (shown here as $\# $) at three positions as indicated here:

It is not possible to divide the sequence into more than four groups that have this property.

Given the two sequences, determine how to partition the new sequence into the maximum possible number of groups.

Input

The first line of input contains a single integer $N$ ($1 \leq N \leq 300\, 000$), which is the length of the two sequences.

The next line contains $N$ integers $a_1, \ldots , a_ N$ ($1 \leq a_ i \leq 10^9$), which is the original sequence.

The next line contains $N$ integers $b_1, \ldots , b_ N$ ($1 \leq b_ i \leq 10^9$), which is the rearranged sequence. The values $b_1, \ldots , b_ N$ are a rearrangement of the values $a_1, \ldots , a_ N$.

Output

Display the rearranged sequence with a valid and maximum placing of dividers ($\# $).

If there are multiple possible solutions, display any of them.

8
1 2 6 2 7 9 8 5
2 6 1 2 9 7 5 8

2 6 1 # 2 # 9 7 # 5 8

4
1 1 2 1
2 1 1 1

2 1 1 # 1

3
1 2 5
2 5 1

2 5 1