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: Wrong Answer)

#[allow(unused_imports)]
use itertools::Itertools;
use proconio::input;
#[allow(unused_imports)]
use proconio::marker::*;

fn main() {
    input! {
        n: usize,
        a: [i64; n],
        b: [i64; n],
    }
    let mut mxlna = 0;
    let mut lna = 1;
    let mut mxlnb = 0;
    let mut lnb = 1;
    for i in 0..n - 1 {
        if a[i + 1] == a[i] {
            lna += 1;
            mxlna = std::cmp::max(mxlna, lna);
        } else {
            lna = 1;
        }
        if b[i + 1] == b[i] {
            lnb += 1;
            mxlnb = std::cmp::max(mxlnb, lnb);
        } else {
            lnb = 1;
        }
    }
    if mxlna + mxlnb > n {
        println!("No");
    } else {
        println!("Yes");
        for i in 0..n {
            print!("{} ", b[(i + std::cmp::max(mxlnb, mxlna)) % n]);
        }
    }
}