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 Haskell (GHC 8.8.3) (judge verdict: Accepted)

import Control.Monad
import Data.Maybe
import Data.List
import Text.Printf
import qualified Data.ByteString.Char8 as C

getInts :: IO [Int]
getInts = map (fst . fromJust . C.readInt) . C.words <$> C.getLine

main :: IO ()
main = do
  _ <- getInts
  as <- getInts
  bs <- getInts
  let bs' = reverse bs
      f = zip as bs'
      o = find (\(x, y) -> x == y) f
      p = snd $ fromJust o
      pp = repeat (p, p)
      ans = if isNothing o then Just bs' else g1
      g1 = if l3 > l1 + l5 then Nothing else Just g2
      (f1, f2') = span (\(x, y) -> x /= p && y /= p) f
      (f2, f3') = span (\(x, y) -> (x == p) /= (y == p)) f2'
      (f3, f4') = span (==(p, p)) f3'
      (f4, f5) = span (\(x, y) -> (x == p) /= (y == p)) f4'
      [l1, l2, l3, l4, l5] = map length [f1, f2, f3, f4, f5]
      [l, r] = [min l1 l3, min (l3 - (min l1 l3)) l5]
      (a, b) = splitAt l f1
      (c, d) = splitAt r f5
      g2 = map snd $ concat [take l pp, b, f2, a, c, f4, take r pp, d]
  putStrLn $ if isNothing ans
    then "No"
    else "Yes\n" ++ (concat $ intersperse " " $ map show (fromJust ans))