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())
from collections import Counter
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ca = Counter(A)
cb = Counter(B)
for i in range(1,N+1):
  if ca[i]+cb[i]>N:
    print('No')
    exit()
print('Yes')
from collections import deque
lis = [[] for _ in range(N+1)]
da = deque(list(range(1,N+1)))
db = deque(list(range(N,0,-1)))
while len(da) and len(db):
  a = da.popleft()
  b = db.popleft()
  if a==b:
    db.append(b)
    b = db.popleft()
  if ca[a]>cb[b]:
    for _ in range(cb[b]):
      lis[a].append(b)
    ca[a] -= cb[b]
    cb[b] = 0
    da.appendleft(a)
  else:
    for _ in range(ca[a]):
      lis[a].append(b)
    cb[b] -= ca[a]
    ca[a] = 0
    if cb[b]>0:
      db.appendleft(b)
ans = []
for i in range(1,N+1):
  for b in lis[i]:
    ans.append(b)
print(*ans)