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.Linq;
using System.Collections.Generic;
class AC
{
    static void Main()
    {
        int N = Cin.Int();
        var A = Cin.ReadSplitInt();
        var B = Cin.ReadSplitInt();
        
        var cnt = new int[N];
        for(var i = 0; i < N; i++)
        {
            cnt[A[i] - 1]++; cnt[B[i] - 1]++;
        }
        for(var i = 0; i < N; i++)
        {
            if (cnt[i] > N)
            {
                Console.WriteLine("No");
                return;
            }
        }
        Console.WriteLine("Yes");
        var ok = true;
        for (var i = 0; i < N; i++) ok &= A[i] != B[i];
        if (ok) { Console.WriteLine(string.Join(" ", B)); return; }

        Array.Reverse(B);
        int cntL = 0, cntR = 0, val = -1, id = -1;
        for(var i = 0; i < N; i++)
        {
            if (A[i] == B[i])
            {
                cntR++;
                val = A[i];
                if (id == -1) id = i;
            }
        }
        if (cntR == 0) { Console.WriteLine(string.Join(" ", B));return; }
        var ans = new int[N];
        for(var i = 1; i < N; i++)
        {
            if (A[i - 1] == val) { cntL++;cntR--; }
            if (B[i - 1] == val) { cntL++;cntR--; }
            if (A[i - 1] == B[i - 1] || A[i] == B[i])
            {
                if (cntL <= i && cntR <= N - i)
                {
                    for (var j = 0; j < i; j++) ans[j] = B[i - 1 - j];
                    for (var j = 0; j < N - i; j++) ans[i + j] = B[N - 1 - j];
                    Console.WriteLine(string.Join(" ", ans));
                    return;
                }
            }
        }

    }
}
static class Cin
{
    public static string Str() => Console.ReadLine();
    public static int Int() => int.Parse(Cin.Str());
    public static long Long() => long.Parse(Cin.Str());
    public static double Double() => double.Parse(Cin.Str());

    private static T Conv<T>(string value) => (T)Convert.ChangeType(value, typeof(T));
    public static (T, U) ReadTuple<T, U>(string[] input) => (Conv<T>(input[0]), Conv<U>(input[1]));
    public static (T, U, V) ReadTuple<T, U, V>(string[] input) => (Conv<T>(input[0]), Conv<U>(input[1]), Conv<V>(input[2]));
    public static (T, U, V, W) ReadTuple<T, U, V, W>(string[] input) => (Conv<T>(input[0]), Conv<U>(input[1]), Conv<V>(input[2]), Conv<W>(input[3]));
    public static (T, U, V, W, X) ReadTuple<T, U, V, W, X>(string[] input) => (Conv<T>(input[0]), Conv<U>(input[1]), Conv<V>(input[2]), Conv<W>(input[3]), Conv<X>(input[4]));

    public static (T, U) Input<T, U>() => ReadTuple<T, U>(ReadSplit());
    public static (T, U, V) Input<T, U, V>() => ReadTuple<T, U, V>(ReadSplit());
    public static (T, U, V, W) Input<T, U, V, W>() => ReadTuple<T, U, V, W>(ReadSplit());
    public static (T, U, V, W, X) Input<T, U, V, W, X>() => ReadTuple<T, U, V, W, X>(ReadSplit());

    public static string[] ReadSplit() => Console.ReadLine().Split();
    public static string[] ReadSplit(char separator) => Console.ReadLine().Split(separator);
    public static int[] ReadSplitInt() => Array.ConvertAll(ReadSplit(), int.Parse);
    public static long[] ReadSplitLong() => Array.ConvertAll(ReadSplit(), long.Parse);
    public static double[] ReadSplit_Double() => Array.ConvertAll(ReadSplit(), double.Parse);
}