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 Python (3.8.2) (judge verdict: Wrong Answer)

#import sys
#input = sys.stdin.readline
from collections import Counter
def main():
    N = int( input())
    A = list( map( int, input().split()))
    B = list( map( int, input().split()))
    CA = Counter(A)
    CB = Counter(B)
    count = 0
    num = 0
    for key in CA:
        s, t = CA[key], CB[key]
        if s > 0 and t > 0:
            if s + t > count:
                count = s+t
                num = key
    if count > N:
        print("No")
        return
    else:
        print("Yes")
    if count == 0:
        print(" ".join( map( str, B)))
        return
    r = 0
    for i in range(N-1,-1,-1):
        if A[i] == num:
            r = i
            break

    l = 0
    for i in range(N):
        if B[i] == num:
            l = i
            break
    G = B[i:] + B[:i]
    ANS =  G[N-1-r:] + G[:N-1-r]
    i = 0
    t = 0
    # print(" ".join( map( str, ANS)))
    while i < N:
        if ANS[i] != A[i]:
            i += 1
            continue
        j = i+1
        while j < N:
            if A[j] != ANS[i]:
                break
            j += 1
        if t < j-i:
            t = j-i
        i = j+1
    # print(t)
    ANS2 = ANS[-t:] + ANS[:-t]
    print(" ".join( map( str, ANS2)))
            
    
    
if __name__ == '__main__':
    main()