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 Ruby (2.7.1) (judge verdict: Accepted)

n = gets.to_i

a = gets.split.map(&:to_i)
b = gets.split.map(&:to_i)

h = Hash.new(0)
b.each {|e| h[e] += 1}

h = h.to_a
lim = h.size
i = l = 0
j = 1

ans = []
n.times do |k|
    if a[k] == h[i][0] && j == lim
        l += 1 while a[l] != a[k] && ans[l] == a[k]
        
        if a[l] == a[k]
            puts "No"
            exit
        end
        ans << ans[l]
        ans[l] = h[i][0]
        h[i][1] -= 1
    elsif a[k] == h[i][0]
        ans << h[j][0]
        h[j][1] -= 1
        j += 1 if h[j][1] == 0
    else
        ans << h[i][0]
        h[i][1] -= 1
        i += 1 while i < lim && h[i][1] == 0
        j = i + 1 if i == j
    end
end

puts "Yes"
puts ans * " "