# Contrast SOLUTION AtCoder Contest 178

## Contrast SOLUTION

Problem Statement

Given are two sequences A and B, both of length N. A and B are each sorted in the ascending order. Check if it is possible to reorder the terms of B so that for each i (1≤i≤N) Ai≠Bi holds, and if it is possible, output any of the reorderings that achieve it.

Constraints

1≤N≤2×105

1≤Ai,Bi≤N

A and B are each sorted in the ascending order.All values in input are integers.

Input

Input is given from Standard Input in the following format: N

A1 A2⋯AN

B1 B2⋯BN

Output

If there exist no reorderings that satisfy the condition, print No.

If there exists a reordering that satisfies the condition, print Yes on the first line. After that, print a reordering of B on the second line, separating terms with a whitespace.If there are multiple reorderings that satisfy the condition, you can print any of them.

Sample Input 1

Copy

6

1 1 1 2 2 3

1 1 1 2 2 3

Sample Output 1

Copy

Yes

2 2 3 1 1 1

Sample Input 2

Copy

3

1 1 2

1 1 3

Sample Output 2

Copy

No

Sample Input 3

Copy

4

1 1 2 3

1 2 3 3

Sample Output 3

Copy

Yes

3 3 1 2