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,
    proconio::{fastout, input, marker::*},
    std::cmp::*,
    std::collections::*,
    std::io::Write,
    std::ops::*,
};

macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

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

    let mut cnt_a = vec![0; n + 1];
    let mut cnt_b = vec![0; n + 1];
    for &a in a.iter() {
        cnt_a[a] += 1;
    }
    for &a in b.iter() {
        cnt_b[a] += 1;
    }
    let mut q = std::collections::BTreeSet::<_>::new();
    for i in 0..=n {
        if cnt_a[i] + cnt_b[i] > n {
            println!("No");
            return;
        }
        let c = cnt_a[i] + cnt_b[i];
        if c > 0 {
            q.insert((c, i, cnt_a[i], cnt_b[i]));
        }
    }

    let mut ch = vec![vec![]; n + 1];
    let mut stock = vec![];
    while let Some(&(c, i, an, bn)) = q.iter().rev().next() {
        q.remove(&(c, i, an, bn));
        if an == 0 {
            stock.push((i, bn));
            continue;
        }
        if let Some((j, d)) = stock.pop() {
            ch[i].push(j);
            if d > 1 {
                stock.push((j, d - 1));
            }
        } else {
            let mut x = (0, 0, 0, 0);
            let mut y = (0, 0, 0, 0);
            for &(c, j, am, bm) in q.iter().rev() {
                if bm != 0 && i != j {
                    ch[i].push(j);
                    if c > 1 {
                        x = (c, j, am, bm);
                        y = (c - 1, j, am, bm - 1);
                    }
                    break;
                }
            }
            q.remove(&x);
            if y.0 > 0 {
                q.insert(y);
            }
        }
        if c > 1 {
            if an == 1 {
                stock.push((i, bn));
            } else {
                q.insert((c - 1, i, an - 1, bn));
            }
        }
    }

    let mut ans = vec![0; n];
    for i in 0..n {
        ans[i] = ch[a[i]].pop().unwrap();
    }

    println!("Yes");
    println!("{}", ans.iter().join(" "));
}