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;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using System.Threading;
static class Program{
	const int mod=(int)1e9+7;
	const double eps=1e-11;
	static void Main(){
		Sc sc=new Sc();
		var n=sc.I;
		var a=sc.Ia;
		var b=sc.Ia;
		var g=new int[n<<1][];
		for(int i = 0;i<n;i++) {
			g[i]=new int[]{a[i],i};
			g[i+n]=new int[]{b[i],-1};
		}
		Array.Sort(g,(u,v)=>u[0]-v[0]);
		var qu1=new Queue<(int,int)>();
		var qu2=new Queue<(int,int)>();
		var ans=new int[n];
		for(int i = 0;i<n;i++) {
			if(g[i][0]==g[n+i][0]){
				Console.WriteLine("No");
				return;
			}
			if(g[i][1]>=0&&g[n+i][1]>=0){qu1.Enqueue((i,n+i));}
			else if(g[i][1]==g[n+i][1]){qu2.Enqueue((i,n+i));}
			else{
				ans[Max(g[i][1],g[n+i][1])]=g[i][1]<g[n+i][1]?g[i][0]:g[n+i][0];
			}
		}
		while(qu1.Count>0){
			var c=qu1.Dequeue();
			var d=qu2.Dequeue();
			if(g[c.Item1][0]!=g[d.Item1][0]){
				ans[Max(g[c.Item1][1],g[d.Item1][1])]=g[c.Item1][1]<g[d.Item1][1]?g[c.Item1][0]:g[d.Item1][0];
				ans[Max(g[c.Item2][1],g[d.Item2][1])]=g[c.Item2][1]<g[d.Item2][1]?g[c.Item2][0]:g[d.Item2][0];
			}
			else{
				ans[Max(g[c.Item1][1],g[d.Item2][1])]=g[c.Item1][1]<g[d.Item2][1]?g[c.Item1][0]:g[d.Item2][0];
				ans[Max(g[c.Item2][1],g[d.Item1][1])]=g[c.Item2][1]<g[d.Item1][1]?g[c.Item2][0]:g[d.Item1][0];
			}
		}
		Console.WriteLine(string.Join(" ",ans));
	}
}
public class Sc{
	public int I{get{return int.Parse(Console.ReadLine());}}
	public long L{get{return long.Parse(Console.ReadLine());}}
	public double D{get{return double.Parse(Console.ReadLine());}}
	public string S{get{return Console.ReadLine();}}
	public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
	public string[] Sa{get{return Console.ReadLine().Split();}}
	public object[] Oa{get{return Console.ReadLine().Split();}}
	public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),double.Parse);}
	public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
	public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
	public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
	public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}