#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>

// AtCoder
// #include <atcoder/all>
// using namespace atcoder;

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
    #define eprintf(...)
#endif

#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).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 (b < a) { a = b; return 1; } return 0; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair <ll,ll> P;
typedef long double ld;

template< typename Monoid >
struct SegmentTree {
    using F = function< Monoid(Monoid, Monoid) >;
    int sz;
    vector< Monoid > seg;
    const F f;
    const Monoid M1;
    SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
        sz = 1;
        while(sz < n) sz <<= 1;
        seg.assign(2 * sz, M1);
    }
    void set(int k, const Monoid &x) {
        seg[k + sz] = x;
    }
    void build() {
        for(int k = sz - 1; k > 0; k--) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    void update(int k, const Monoid &x) {
        k += sz;
        seg[k] = x;
        while(k >>= 1) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    Monoid query(int a, int b) {
        Monoid L = M1, R = M1;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) L = f(L, seg[a++]);
            if(b & 1) R = f(seg[--b], R);
        }
        return f(L, R);
    }
    Monoid operator[](const int &k) const {
        return seg[k + sz];
    }
    template< typename C >
    int find_subtree(int a, const C &check, Monoid &M, bool type) {
        while(a < sz) {
            Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
            if(check(nxt)) a = 2 * a + type;
            else M = nxt, a = 2 * a + 1 - type;
        }
        return a - sz;
    }
    template< typename C >
    int find_first(int a, const C &check) {
        Monoid L = M1;
        if(a <= 0) {
            if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
            return -1;
        }
        int b = sz;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) {
                Monoid nxt = f(L, seg[a]);
                if(check(nxt)) return find_subtree(a, check, L, false);
                L = nxt;
                ++a;
            }
        }
        return -1;
    }
    template< typename C >
    int find_last(int b, const C &check) {
        Monoid R = M1;
        if(b >= sz) {
            if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
            return -1;
        }
        int a = sz;
        for(b += sz; a < b; a >>= 1, b >>= 1) {
            if(b & 1) {
                Monoid nxt = f(seg[--b], R);
                if(check(nxt)) return find_subtree(b, check, R, true);
                R = nxt;
            }
        }
        return -1;
    }
};

P pmax (P a, P b) {
    // num, i
    if (a.first > b.first) return a;
    if (a.first < b.first) return b;
    else return a;
}

int main (void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n; cin >> n;
    vector<ll> a(n), b(n);
    rep (i, n) cin >> a[i];
    rep (i, n) cin >> b[i];
    map<ll, int> ma, mb;
    rep (i, n) {
        ma[a[i]]++;
        mb[b[i]]++;
    }
    // vector<P> m;
    for (auto [x, k] : ma) {
        ll kk = k + mb[x];
        // m.emplace_back(kk, x);
        if (kk > n) {
            cout << "No\n";
            return 0;
        }
    }
    vector<ll> ans(n);
    // sort(all(m), [](P a, P b) { return (a.first != b.first) ? (a.first > b.first) : (a.second < b.second); });
    SegmentTree<P> segl(n + 1, pmax, P{-1, 0}), segr(n + 1, pmax, P{-1, 0});
    for (auto [x, k] : ma) {
        if (k == 0) continue;
        segl.update(x, P{mb[x], x});
    }
    for (auto [x, k] : mb) {
        if (k == 0) continue;
        segr.update(x, P{ma[x], x});
    }
    vector<ll> sta(n + 1, -1), stb(n + 1, -1);
    rep (i, n) {
        if (sta[a[i]] == -1) sta[a[i]] = i;
        if (stb[b[i]] == -1) stb[b[i]] = i;
    }
    rep (i, n) {
        auto [na, ca] = segl.query(0, n + 1);
        auto [nb, cb] = pmax(segr.query(0, ca), segr.query(ca + 1, n + 1));
        eprintf("%lld %lld\n", ca, cb);
        ans[sta[ca]++] = cb;
        if (--ma[ca] == 0) segl.update(ca, P{-1, ca});
        if (--mb[cb] == 0) segr.update(cb, P{-1, cb});
        segl.update(cb, P{segl.query(cb, cb + 1).first - 1, cb});
        segr.update(ca, P{segr.query(ca, ca + 1).first - 1, ca});
    }
    cout << "Yes\n";
    rep (i, n) cout << ans[i] << " \n"[i + 1 == n];
    /***************************************************/
    /* Submit this code from the browser if using ACL! */
    /***************************************************/
    return 0;
}

Measured memory_bytes: 52192