#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

struct SegmentTree
{
    using T = Pii;

    int N;
    vector<T> dat;

    T id = Pii(-1, -1);
    T F(T &a, T &b) { return max(a, b); }
    
    SegmentTree(int n){
        N = 1;
        while(n > N) N = N << 1;
        dat = vector<T>(2 * N - 1, id);
    }

    SegmentTree(int n, vector<T> &v){
        N = 1;
        while(n > N) N = N << 1;
        dat = vector<T>(2 * N - 1, id);
        for(int i = 0; i < n; i++) dat[i + N - 1] = v[i];
        for(int i = N - 2; i >= 0; i--) dat[i] = F(dat[i * 2 + 1], dat[i * 2 + 2]); 
    }

    SegmentTree(){}


    void update(int k, T a){
        k += N - 1;
        dat[k] = a;
        while(k > 0){
            k = (k - 1) / 2;
            dat[k] = F(dat[k * 2 + 1], dat[k * 2 + 2]);
        }
    }

    void reset() { fill(dat.begin(), dat.end(), id); }

    T get(int a, int b, int k, int l, int r){
        if(r <= a || b <= l) return id;
        if(a <= l && r <= b) return dat[k];
        else{
            T vl = get(a, b, k * 2 + 1, l, (l + r) / 2);
            T vr = get(a, b, k * 2 + 2, (l + r) / 2, r);
            return F(vl, vr);
        }
    }
    T get(int a, int b) { return get(a, b, 0, 0, N); }

    T val(int k){ return dat[k + N - 1]; }
};

signed main(){

    int N; cin >> N;
    vec A(N), B(N);
    cin >> A >> B;

    vec cnt0(N, 0), cnt1(N, 0);
    REP(i, N){
        A[i]--; B[i]--;
        cnt0[A[i]]++;
        cnt1[B[i]]++;
    }

    REP(i, N) if(cnt0[i] + cnt1[i] > N){
        Out("No");
        return 0;
    }
    
    SegmentTree ST(N);
    REP(i, N) ST.update(i, Pii(cnt0[i] + cnt1[i], i));

    set<int> s0, s1;
    REP(i, N){
        if(cnt0[i]) s0.insert(i);
        if(cnt1[i]) s1.insert(i);
    }

    mat ls(N, vec(2));
    REP(i, N){
        Pii t = ST.get(0, N);
        int i0 = t.se;
        int j;
        if(cnt0[i0]){
            j = 0;
            cnt0[i0]--;
            if(cnt0[i0] == 0) s0.erase(i0);
        }else{
            j = 1;
            cnt1[i0]--;
            if(cnt1[i0] == 0) s1.erase(i0);
        }

        int i1;
        if(j == 0){
            auto it = s1.begin();
            if(*it == i0) it++;
            i1 = *it;

            cnt1[i1]--;
            if(cnt1[i1] == 0) s1.erase(i1);
        }else{
            auto it = s0.begin();
            if(*it == i0) it++;
            i1 = *it;

            cnt0[i1]--;
            if(cnt0[i1] == 0) s0.erase(i1);
        }

        ls[i][j] = i0;
        ls[i][1 - j] = i1;

        ST.update(i0, Pii(cnt0[i0] + cnt1[i0], i0));
        ST.update(i1, Pii(cnt0[i1] + cnt1[i1], i1));
    }

    v_Pii ans(N);
    REP(i, N) ans[i] = Pii(ls[i][0], ls[i][1]);
    Sort(ans);
 
    Out("Yes");
    REP(i, N){
        cout << ans[i].se + 1 << " ";
    }
    cout << endl;

    return 0;
}


Measured memory_bytes: 47196