#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

void No() {
    cout << "No" << ln;
    exit(0);
}
int main() {
    int N; cin >> N;
    vector<int> A(N),B(N);
    rep(i,N) cin >> A[i];
    rep(i,N) cin >> B[i];

    vector<int> cnt_a(N+1),cnt_b(N+1);
    rep(i,N) {
        cnt_a[A[i]]++;
        cnt_b[B[i]]++;
    }
    priority_queue<pii> pq;
    for (int i = 1; i <= N; i++) {
        if (cnt_b[i]) pq.emplace(cnt_b[i]+cnt_a[i],i);
    }
    vector<int> ans(N);
    rep(i,N) {
        while(!pq.empty() and pq.top().first!=cnt_a[pq.top().second]+cnt_b[pq.top().second]) pq.pop();
        if (pq.empty()) No();
        auto[cnt,b] = pq.top(); pq.pop();
        if (cnt > N-i) No();
        if (b!=A[i]) {
            ans[i] = b;
            cnt_b[b]--;
            cnt_a[A[i]]--;
            if (cnt_b[b]) pq.emplace(cnt_b[b]+cnt_a[b],b);
            if (cnt_b[A[i]]) pq.emplace(cnt_b[A[i]]+cnt_a[A[i]],A[i]);
        } else {
            while(!pq.empty() and pq.top().first!=cnt_a[pq.top().second]+cnt_b[pq.top().second]) pq.pop();
            if (pq.empty()) No();
            auto[cnt2,b2] = pq.top(); pq.pop();
            if (cnt2 > N-i) No();
            ans[i] = b2;
            cnt_b[b2]--;
            cnt_a[A[i]]--;
            if (cnt_b[b2]) pq.emplace(cnt_b[b2]+cnt_a[b2],b2);
            if (cnt_b[A[i]]) pq.emplace(cnt_b[A[i]]+cnt_a[A[i]],A[i]);
        }
    }

    cout << "Yes" << ln;
    print(ans);
}


Measured memory_bytes: 8480