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 Scala (2.13.1) (judge verdict: Accepted)

object Main extends App {
  val sc = new java.util.Scanner(System.in)
  val n = sc.nextInt()
  val a, b = List.fill(n)(sc.nextInt()-1)
  val c = Array.fill(n)(0)
  val d = Array.fill(n)(0)
  for (i <- a) {
    c(i) += 1
  }

  for (i <- b) {
    d(i) += 1
  }

  if ((0 until n).exists(i => c(i) + d(i) > n)) {
    println("No")
  } else {
    val cc = c.scanLeft(0)(_+_)
    val cd = d.scanLeft(0)(_+_)
    var m = 0
    for (i <- 1 to n) {
      m = m.max(cc(i) - cd(i-1))
    }
    println("Yes")
    println((b.takeRight(m) ++ b.dropRight(m)).map(_+1).mkString(" "))
  }
}