Problem:
Score : 600 points

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 \leq i \leq N) A_i \neq B_i holds, and if it is possible, output any of the reorderings that achieve it.

Constraints

1\leq N \leq 2 \times 10^5

1\leq A_i,B_i \leq 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
A_1 A_2 \cdots A_N
B_1 B_2 \cdots B_N

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

6
1 1 1 2 2 3
1 1 1 2 2 3

Sample Output 1

Yes
2 2 3 1 1 1

Sample Input 2

3
1 1 2
1 1 3

Sample Output 2

No

Sample Input 3

4
1 1 2 3
1 2 3 3

Sample Output 3

Yes
3 3 1 2

Solution in PyPy3 (7.3.0) (judge verdict: Runtime Error)

import collections
n=int(input())
ax=list(map(int,input().split()))
bx=list(map(int,input().split()))

a=collections.Counter(ax)
b=collections.Counter(bx)
ma=a.most_common()[0][1]
mb=b.most_common()[0][1]
an=a.most_common()[0][0]
bn=b.most_common()[0][0]
mab=ax.count(bn)
mba=bx.count(an)

if ma+mab>n or mb+mba>n:
    print("No")
else:
    print("Yes")
    bl=b.most_common()
    ans=[0]*n
    j=0
    k=0
    for i in bl:
        bl[k]=list(i)
        k+=1
    for i in range(n):
        if bl[j][1]==0:
            j+=1
        if int(bl[j][0])!=int(ax[i]):
            ans[i]=bl[j][0]
            bl[j][1]-=1
        else:
            z=j+1
            while True:
                if bl[z][1]>0:
                    ans[i]=bl[z][0]
                    bl[z][1]-=1
                    break
                else:
                    z+=1
    print(*ans)