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: Wrong Answer)

n=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
D=[0]*(n+1)
s=0
for i in range(n):
  if s<A[i]:
    s=A[i]
    D[s]=i+1
print(D)
C=[[0]*4 for i in range(n+1)]
for i in range(n+1):
  C[i][3]=i
for i in A:
  C[i][0]+=1
  C[i][1]+=1
for i in B:
  C[i][0]+=1
  C[i][2]+=1
C.sort(reverse=True)
print(C)
if C[0][0]>n:
  print("No")
  exit()
AA=[[0]*3 for i in range(n)]
a=0
b=0
c=0
for i in range(n):
  if C[i][1]+C[i][2]<n-a-b:
    for j in range(C[i][1]):
      AA[a+j][0]=C[i][3]
      AA[a+j][2]=D[C[i][3]]+j-1
    for j in range(C[i][2]):
      AA[b-1-j][1]=C[i][3]
    a=a+C[i][1]
    b=b+C[i][2]
    print(AA)
  elif n-a-b>0:
    if C[i][1]>=n-a-b:
      for j in range(C[i][1]):
        AA[a+j][0]=C[i][3]
        AA[a+j][2]=D[C[i][3]]+j-1
      a=a+C[i][1]
      for j in range(n-a-b):
        AA[b-1-j][1]=D[C[i][3]]
      for k in range(C[i][2]-j):
        AA[k][1]=C[i][3]
      print(AA)
    else:
      pass