#include <bits/stdc++.h>
using Int = long long;  // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(v) std::begin(v), std::end(v)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif  // clang-format on

/**
 *    author:  knshnb
 *    created: Sun Sep 13 21:25:15 JST 2020
 **/

/// @docs src/DataStructure/SegmentTree.md
template <class T, class F> struct SegmentTree {
    const F op;
    const T e;
    SegmentTree(F op_, T e_) : op(op_), e(e_) {}
    int n;
    std::vector<T> t;
    void set_by_identity(int n_) {
        n = n_;
        t.clear(), t.resize(2 * n, e);
    }
    void set_by_vector(const std::vector<T>& a) {
        n = a.size();
        t.clear(), t.resize(2 * n, e);
        for (int i = 0; i < n; i++) t[i + n] = a[i];
        build();
    }
    void build() {
        for (int i = n - 1; i; --i) t[i] = op(t[2 * i], t[2 * i + 1]);
    }
    T& operator[](int i) { return t[i + n]; }
    // [l, r)
    T query(int l, int r) const {
        assert(0 <= l && l <= r && r <= n);
        T resl = e, resr = e;
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l & 1) resl = op(resl, t[l++]);
            if (r & 1) resr = op(t[--r], resr);
        }
        return op(resl, resr);
    }
    // i番目をxに変更
    void update(int i, const T& x) {
        assert(0 <= i && i < n);
        t[i += n] = x;
        while (i >>= 1) t[i] = op(t[2 * i], t[2 * i + 1]);
    }
    // i番目にxを作用 (a[i] = op(a[i], x))
    void operate(int i, const T& x) {
        assert(0 <= i && i < n);
        i += n;
        t[i] = op(t[i], x);
        while (i >>= 1) t[i] = op(t[2 * i], t[2 * i + 1]);
    }
    friend std::string to_string(const SegmentTree<T, F>& seg) {
        return to_string(std::vector<T>(seg.t.begin() + seg.n, seg.t.end()));
    }
};
template <class T, class F> auto make_segment_tree(F op, T e) { return SegmentTree<T, F>(op, e); }

void no() {
    std::cout << "No\n";
    exit(0);
}
using pii = std::pair<Int, Int>;
signed main() {
    Int n;
    std::cin >> n;
    std::map<Int, Int> rem;
    std::vector<Int> a(n), b(n);
    REP(i, n) std::cin >> a[i], a[i]--;
    REP(i, n) std::cin >> b[i], b[i]--, rem[b[i]]++;
    auto seg = make_segment_tree<pii>([&](pii x, pii y) { return std::max(x, y); }, {-1e9, -1});
    seg.set_by_identity(n);
    REP(i, n) seg.update(i, {0, i});
    REP(i, n) {
        for (Int x : {a[i], b[i]}) {
            auto p = seg.query(x, x + 1);
            assert(x == p.second);
            seg.update(x, {p.first + 1, p.second});
        }
    }
    std::vector<Int> ans;
    REP(i, n) {
        dump(seg);
        {
            auto p = seg.query(a[i], a[i] + 1);
            seg.update(a[i], {p.first - 1, p.second});
        }
        auto p1 = seg.query(0, n);
        while (rem[p1.second] == 0) {
            // dump(p1);
            seg.update(p1.second, {-1, p1.second});
            p1 = seg.query(0, n);
        }
        if (p1.second != a[i]) {
            ans.push_back(p1.second);
            rem[p1.second]--;
            seg.update(p1.second, {p1.first - 1, p1.second});
        } else {
            seg.update(p1.second, {0, p1.second});
            auto p2 = seg.query(0, n);
            dump(rem, p2);
            while (rem[p2.second] == 0) {
                // dump(seg, p2);
                seg.update(p2.second, {-1, p2.second});
                p2 = seg.query(0, n);
            }
            if (p2.first <= 0) no();
            ans.push_back(p2.second);
            rem[p2.second]--;
            seg.update(p2.second, {p2.first - 1, p2.second});
            seg.update(p1.second, p1);
        }
    }
    std::cout << "Yes\n";
    REP(i, n) std::cout << ans[i] + 1 << " ";
    std::cout << std::endl;
}


Measured memory_bytes: 27088