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 PyPy2 (7.3.0) (judge verdict: Wrong Answer)

from collections import Counter
def f():
  if max(c.values())>2*n:
    return "No"
  s=set(c.keys())
  z=[]
  for i in xrange(n):
    q=[]
    while s:
      q.append(s.pop())
      if q[-1]!=a[i]:
        break
    if q[-1]==a[i]:
      return "No"
    c[q[-1]]-=1      
    z.append(q[-1])
    for i in q:
      if c[i]>0:
        s.add(i)
  return "Yes\n"+' '.join(map(str,z)) if all(x!=y for x,y in zip(a,z)) else "No"
n=input()
a=map(int,raw_input().split())
c=Counter(map(int,raw_input().split()))
print f()