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)

import sys
import io, os
input = sys.stdin.buffer.readline
#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

ans = [-1]*n
from collections import deque
q = deque([])
for i in range(n):
    if A[i] == B[i]:
        q.append(B[i])
        if q[0] != A[i]:
            ans[i] = q[0]
            q.popleft()
        else:
            continue
    else:
        ans[i] = B[i]
for i in range(n):
    if ans[i] == -1:
        if A[i] != q[0]:
            ans[i] = q[0]
            q.popleft()
        elif A[i] != q[-1]:
            ans[i] = q[-1]
            q.pop()
        else:
            print('No')
            exit()
else:
    print('Yes')
    print(*ans)