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# (Mono-mcs 6.8.0.105) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
class Program
{
	static void Main(string[] args)
	{
		int N = int.Parse(Console.ReadLine());
		int[]A = new int[N];
		int[]B = new int[N];
		string[] str1 = Console.ReadLine().Split();
		string[] str2 = Console.ReadLine().Split();
		int[]C = new int[N];
		int[]D = new int[N];
		bool flag = true;
		for(var i=0;i<N;i++){
			A[i] = int.Parse(str1[i]);
			B[i] = int.Parse(str2[i]);
			C[A[i]-1]++;
			D[B[i]-1]++;
		}
		for(var i=0;i<N;i++){
			if(C[i]+D[i]>N){
				flag = false;
			}
		}
		if(!flag){
			Console.WriteLine("No");
		} else {
			Console.WriteLine("Yes");
			int a1 = 0;
          	int a2 = 0;
			var list = new List<int>();
			for(var i=0;i<N;i++){
				int nct = 0;
				while(A[i] == a1+1 || D[a1]==0){
					a1 = (a1 + 1) % N;
					nct++;
					if(nct>=N){
						break;
					}
				}
				if(nct>=N){
					while(A[a2]==A[i]){
                      	a2 = (a2 + 1) % N;
                    }
					int t = list[a2];
                  	list[a2] = A[i];
                  	list.Add(t);
                } else {
					list.Add(a1+1);
					D[a1]--;
                }
			}
			if(!flag){
              	Console.WriteLine("No");
			} else {
				Console.Write(list[0]);
				for(var i=1;i<N;i++){
					Console.Write(" "+list[i]);
				}
            }
			Console.WriteLine();
		}
	}
}