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 (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
int main(){
  int n,a[200010]={},b[200010]={},c[200010],d[200020],e=0,i,g[200020],f=0;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&c[i]);
    a[c[i]]++;
  }
  for(i=0;i<n;i++){
    scanf("%d",&d[i]);
    b[d[i]]++;
  }
  for(i=0;i<n;i++){
    if(a[i]*2>n&&b[i]*2>n){
      printf("No\n");
      return 0;
    }
  }
  printf("Yes\n");
  for(i=e=0;i<n;i++){
    if(c[i]==d[n-i-1]){
      if(e==0)f=i;
      e++;
    }
  }
  //printf("%d %d\n",f,e);
  if(f+e>n-e){
    for(i=0;i<n;i++){
      if(i<f)g[i+e]=d[n-i-1];
      else if(i<f+e)g[i-f]=d[n-i-1];
      else g[i]=d[n-i-1];
    }
  }
  else{
    for(i=0;i<n;i++){
      if(i<f)g[i]=d[n-i-1];
      else if(i<f+e)g[n-e+i-f]=d[n-i-1];
      else g[i-e]=d[n-i-1];
    }
  }
  for(i=0;i<n;i++)printf("%d%c",g[i],i+1==n?'\n':' ');
  return 0;
}