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 static System.Console;
using System.Collections.Generic;
using System.Text;

namespace abc178
{
    class Program
    {
        static void Main()
        {
            var n = int.Parse(ReadLine());
            var aList = ReadNumList();
            var bList = ReadNumList();
            Write(Contrast(aList, bList));
        }
        static string Contrast(int[] aList, int[] bList)
        {
            var aMap = new int[aList.Length + 1];
            foreach (var a in aList)
            {
                ++aMap[a];
            }
            var bMap = new int[bList.Length + 1];
            foreach (var b in bList)
            {
                ++bMap[b];
            }
            var max = 0;
            var maxI = 0;
            for (var i = 1; i < aMap.Length; ++i)
            {
                if (aMap[i] + bMap[i] > aList.Length)
                {
                    return "No\n";
                }
                if (max < aMap[i] + bMap[i])
                {
                    max = aMap[i] + bMap[i];
                    maxI = i;
                }
            }
            var maxCount = aMap[maxI];
            var bResult = new int[bList.Length];
            for (var i = 0; i < bList.Length; ++i)
            {
                bResult[i] = bList[(i + maxCount) % bList.Length];
            }
            var sb = new StringBuilder();
            sb.Append("Yes\n");
            for (var i = 0; i < bResult.Length; ++i)
            {
                sb.Append(bResult[i]);
                if (i == bResult.Length - 1)
                {
                    sb.Append("\n");
                }
                else
                {
                    sb.Append(" ");
                }
            }
            return sb.ToString();
        }
        static int[] ReadNumList()
        {
            var line = Console.ReadLine().Split(' ');
            if (line.Length == 1 && string.IsNullOrEmpty(line[0]))
            {
                return new int[0];
            }
            var numList = new int[line.Length];
            for (var i = 0; i < line.Length; ++i)
            {
                numList[i] = int.Parse(line[i]);
            }
            return numList;
        }
    }
}