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 C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;

namespace ConsoleApp1
{
    class ABC178F
    {
        // https://atcoder.jp/contests/abc178/tasks/abc178_f

        const long m = 1000000007;
        static int[] A = new int[200001];
        static int[] B = new int[200001];

        static int[] CA = new int[200001];
        static int[] CB = new int[200001];

        static void Main(string[] args)
        {
            int N = Int32.Parse(Console.ReadLine());
            var itemsA = Console.ReadLine().Split();
            var itemsB = Console.ReadLine().Split();

            for (int i = 0; i < N; i++)
            {
                A[i] = Int32.Parse(itemsA[i]);
                B[i] = Int32.Parse(itemsB[i]);

                CA[A[i]] += 1;
                CB[B[i]] += 1;
            }

            for (int i = 0; i < N; i++)
            {
                if (CA[i] + CB[i] > N)
                {
                    Console.WriteLine("No");
                    return;
                }
            }

            int max = 0;

            for (int i = 1; i <= N; i++)
            {
                CA[i] += CA[i - 1];
                CB[i] += CB[i - 1];

                max = Math.Max(max, CA[i] - CB[i - 1]);
            }

            Console.WriteLine("Yes");

            for (int i = 0; i < N - 1; i++)
            {
                int index = (i + N - max) % N;
                Console.Write(B[index] + " ");
            }

            int index2 = (N - 1 + N - max) % N;
            Console.WriteLine(B[index2]);
        }
    }
}