#include <bits/stdc++.h>

// #include <atcoder/all>

using namespace std;
// using namespace atcoder;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


signed main() {
    fio();
    int n;
    cin >> n;
    vi a(n), b(n);
    rep (i, n) cin >> a[i];
    rep (i, n) cin >> b[i];

    map<int, int> mpa, mpb;
    rep (i, n) {
        mpa[a[i]]++;
        mpb[b[i]]++;
    }
    set<pii> sta, stb;
    for (auto itr = mpa.begin(); itr != mpa.end(); itr++) {
        sta.insert(pii(itr->second, itr->first));
    }
    for (auto itr = mpb.begin(); itr != mpb.end(); itr++) {
        stb.insert(pii(itr->second, itr->first));
    }

    set<pii> st;
    vi num(n + 1);
    rep1 (i, n) {
        int cnt = 0;
        if (mpa.count(i)) cnt += mpa[i];
        if (mpb.count(i)) cnt += mpb[i];
        if (cnt > 0) {
            st.insert(pii(cnt, i));
        }
        num[i] = cnt;
    }

    vector<pii> ans;
    rep (_, n) {
        auto itr = st.end();
        itr--;
        pii temp = *itr;
        // st.erase(itr);
        int u = temp.second;
        // temp.first--;
        // if (temp.first > 0) st.insert(temp);

        auto itr1 = mpa.lower_bound(u), itr2 = mpb.lower_bound(u);
        if (itr1->first == u) {
            itr2 = mpb.begin();
            while (itr2 != mpb.end() and itr2->first == u) itr2++;
        }
        else {
            itr1 = mpa.begin();
            while (itr1 != mpb.end() and itr1->first == u) itr1++;
        }
        if (itr1 == mpa.end() or itr2 == mpb.end()) {
            cout << "No" << endl;
            return 0;
        }

        u = itr1->first;
        int v = itr2->first;
        ans.push_back(pii(u, v));
        itr1->second--; itr2->second--;
        if (itr1->second == 0) mpa.erase(itr1);
        if (itr2->second == 0) mpb.erase(itr2);

        itr = st.lower_bound(pii(num[u], u));
        temp = *itr;
        st.erase(itr);
        temp.first--;
        num[u]--;
        if (temp.first > 0) st.insert(temp);
        itr = st.lower_bound(pii(num[v], v));
        temp = *itr;
        st.erase(itr);
        temp.first--;
        num[v]--;
        if (temp.first > 0) st.insert(temp);
        // DEBUG_VEC(ans);
    }
    sort(all(ans));

    cout << "Yes" << endl;
    rep (i, n) {
        cout << ans[i].second << " ";
    }
    cout << endl;
}

Measured memory_bytes: 54424