#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int sign(int x) { return (x > 0) - (x < 0); }
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int cdiv(int a, int b) { return (a - 1 + b) / b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T> T sq(T x) { return x * x; }
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

signed main() {
    int N;
    cin >> N;
    vint A(N), B(N);
    rep(i, N) { cin >> A[i]; }
    rep(i, N) { cin >> B[i]; }
    vpint ans;
    vint cntA(N + 1), cntB(N + 1);
    rep(i, N) { cntA[A[i]]++, cntB[B[i]]++; }
    set<pint> stA, stB;
    reps(i, N) {
        if (cntA[i] + cntB[i] > N) { fin("No"); }
        if (cntA[i]) { stA.emplace(cntA[i] + cntB[i], i); }
        if (cntB[i]) { stB.emplace(cntA[i] + cntB[i], i); }
    }
    rep(i, N) {
        auto sA = prev(stA.end()), sB = prev(stB.end());
        pint pA = *sA, pB = *sB;
        stA.erase(sA), stB.erase(sB);
        if (pA.second == pB.second) {
            auto ssB = prev(stB.end());
            pint ppB = *ssB;
            stB.erase(ssB);
            stB.emplace(pB);
            swap(pB, ppB);
        }
        ans.emplace_back(pA.second, pB.second);
        cntA[pA.second]--, cntB[pB.second]--;
        pA.first--, pB.first--;
        if (cntA[pB.second]) {
            auto s = stA.lower_bound({pB.first + 1, pB.second});
            stA.erase(s);
            if (cntA[pB.second]) { stA.emplace(pB); }
        }
        if (cntB[pA.second]) {
            auto s = stB.lower_bound({pA.first + 1, pA.second});
            stB.erase(s);
            if (cntB[pA.second]) { stB.emplace(pA); }
        }
        if (cntA[pA.second]) { stA.emplace(pA); }
        if (cntB[pB.second]) { stB.emplace(pB); }
    }
    cout << "Yes" << endl;
    sort(all(ans));
    for (auto p:ans) { cout << p.second << " "; }
    cout << endl;
}

Measured memory_bytes: 38628