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: Accepted)

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define REP(i,a,b) for(int i=int(a);i<(int)b;++i)
#define Graph vector<vecctor<ll>>
#define pairs vector<pair<ll,ll>>
#define pb push_back



using namespace std;
using ll = long long;
const ll INF = 1e18;
const double PI = acos(-1);

template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
const ll mod = 1e9 + 7;








int main(void)
{
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    vector<ll>a(n),b(n);
    map<ll,ll>map_a,map_b;
    ll cnt = 0;
    rep(i,n){
        cin >> a[i];
        cnt++;
        if(i >= 1){
            if(a[i-1] != a[i]){
                map_a[a[i-1]] = cnt-1;
                cnt = 1;
            }
        }
    }
    map_a[a[n-1]] = cnt;
    cnt = 0;
    rep(i,n){
        cin >> b[i];
        cnt++;
        if(i >= 1){
            if(b[i-1] != b[i]){
                map_b[b[i-1]] = cnt-1;
                cnt = 1;
            }
        }
    }
    map_b[b[n-1]] = cnt;
    
    reverse(b.begin(),b.end());
    ll num = 0,sta,res;
    rep(i,n){
        if(a[i] == b[i]){
            num++;
            if(num == 1)sta = i;
            res = a[i];
        }
    }
    if(num == 0){
        cout << "Yes" << endl;
        rep(i,n){
            cout << b[i] << " ";
        }
        cout << "\n";
        return 0;
    }
    if(n-(map_a[res] + map_b[res]-num) >= num){
        cout << "Yes" << endl;
        bool flag = false;
        ll k;
        rep(i,num){
            if(a[i] == res || b[i] == res){
                if(!flag){
                    flag = true;
                    k = i;
                }
            }
            ll j;
            if(flag)j = n-i+k-1;
            else j = i;
            swap(b[j],b[sta+i]);
        }
        rep(i,n)cout << b[i] << " ";
        cout << "\n";
    }else{
        cout << "No" << endl;
        
    }
    

    return 0;
}