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 Rust (1.42.0) (judge verdict: Accepted)

use proconio::{input, marker::Usize1};

fn main() {
    input! {
        n: usize,
        a: [Usize1; n],
        mut b: [Usize1; n],
    }

    let mut c = vec![0; n];
    let mut d = vec![0; n];
    for i in 0..n {
        c[a[i]] += 1;
        d[b[i]] += 1;
    }

    if c[0] + d[0] > n {
        println!("No");
    } else {
        for i in 1..n {
            if c[i] + d[i] > n {
                println!("No");
                return
            }
            c[i] += c[i - 1];
            d[i] += d[i - 1];
        }

        let mut x = c[0] as isize;
        for i in 1..n {
            x = x.max(c[i] as isize - d[i - 1] as isize)
        }

        if x >= 0 {
            b.rotate_right(x as usize);
        } else {
            b.rotate_left(x.abs() as usize);
        }

        println!("Yes");
        println!("{}", b.iter().map(|v| (v + 1).to_string()).collect::<Vec<String>>().join(" "));
    }
}