#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T, class U>
ostream &operator<<(ostream &os, const pair <T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
ostream &operator<<(ostream &os, const vector <T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;

const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld EPS = 1e-9;


template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : to(to), cost(cost) {}

    friend ostream &operator<<(ostream &os, const edge &e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;


template<int64_t mod>
class modint {
    int64_t x;

public:
    modint(int64_t x = 0) : x(x < 0 ? ((x % mod) + mod) % mod : x % mod) {}

    const modint operator-() const { return x ? mod - x : 0; }

    modint &operator+=(const modint &rhs) {
        if ((x += rhs.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator-=(const modint &rhs) {
        return *this += -rhs;
    }

    modint &operator*=(const modint &rhs) {
        (x *= rhs.x) %= mod;
        return *this;
    }

    modint &operator/=(const modint &rhs) {
        return *this *= rhs.pow(mod - 2);
    }

    friend const modint operator+(modint lhs, const modint &rhs) {
        return lhs += rhs;
    }

    friend const modint operator-(modint lhs, const modint &rhs) {
        return lhs -= rhs;
    }

    friend const modint operator*(modint lhs, const modint &rhs) {
        return lhs *= rhs;
    }

    friend const modint operator/(modint lhs, const modint &rhs) {
        return lhs /= rhs;
    }

    const modint pow(int64_t n) const {
        modint ret = 1, tmp = *this;
        while (n) {
            if (n & 1) ret *= tmp;
            tmp *= tmp;
            n >>= 1;
        }
        return ret;
    }

    friend bool operator==(const modint &lhs, const modint &rhs) {
        return lhs.x == rhs.x;
    }

    friend bool operator!=(const modint &lhs, const modint &rhs) {
        return !(lhs == rhs);
    }

    friend ostream &operator<<(ostream &os, const modint &a) {
        return os << a.x;
    }

    friend istream &operator>>(istream &is, modint &a) {
        int64_t tmp;
        is >> tmp;
        a = tmp;
        return is;
    }
};


template<typename Field>
struct Combination {
    vector<Field> _fact, _rfact, _inv;

    Combination(int n) : _fact(n), _rfact(n), _inv(n) {
        _fact[0] = _rfact[n - 1] = 1;
        for (int i = 1; i < n; ++i) _fact[i] = _fact[i - 1] * i;
        _rfact[n - 1] /= _fact[n - 1];
        for (int i = n - 1; i > 0; --i) _rfact[i - 1] = _rfact[i] * i;
        for (int i = 1; i < n; ++i) _inv[i] = _rfact[i] * _fact[i - 1];
    }

    inline Field fact(int k) const { return _fact.at(k); }

    inline Field rfact(int k) const { return _rfact.at(k); }

    inline Field inv(int k) const {
        assert(k != 0);
        return _inv.at(k);
    }

    Field P(int n, int r) const {
        if (r < 0 or n < r) return 0;
        return fact(n) * rfact(n - r);
    }

    Field C(int n, int r) const {
        if (r < 0 or n < r) return 0;
        return fact(n) * rfact(r) * rfact(n - r);
    }

    Field H(int n, int r) const {
        return (n == 0 and r == 0) ? 1 : C(n + r - 1, r);
    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(5);

    int n; cin >> n;
    vi a(n), b(n);
    map<int,int> cnta, cntb;
    map<int,bool> nums;
    REP(i, n) {
        cin >> a[i];
        ++cnta[a[i]];
        nums[a[i]] = true;
    }
    REP(i, n) {
        cin >> b[i];
        ++cntb[b[i]];
        nums[b[i]] = true;
    }

    vector<pair<int,int>> ord;
    for (auto& p : nums) {
        int num = p.first;
        int ca = (cnta.count(num) ? cnta[num] : 0);
        int cb = (cntb.count(num) ? cntb[num] : 0);
        //int sum = ca + cb;
        int sum = cb;
        if (ca + cb > n) {
            cout << "No" << endl;
            return 0;
        }
        ord.emplace_back(sum, num);
    }
    cout << "Yes" << endl;
    sort(ALL(ord));
    reverse(ALL(ord));

    //DUMP(ord);

    map<int,int> mp;
    REP(i, SZ(ord)) {
        mp[ord[i].second] = i;
    }

    vi ca = a, cb = b;
    sort(ALL(ca), [&](int l, int r){ return mp[l] < mp[r]; });
    sort(ALL(cb), [&](int l, int r){ return mp[l] < mp[r]; });

    //DUMP(ca);
    //DUMP(cb);

    vi diff(n);
    REP(i, n) {
        if (i) diff[i] = diff[i-1];
        while (ca[(i + diff[i]) % n] == cb[i]) ++diff[i];
    }

    int dmax = *max_element(ALL(diff));

    vi ansb(n);
    REP(i, n) {
        ansb[(i + dmax) % n] = cb[i];
    }
    //DUMP(ansb);

    map<int,map<int,int>> candidates;
    REP(i, n) {
        ++candidates[ca[i]][ansb[i]];
    }

    vi ans(n);
    REP(i, n) {
        auto it = candidates[a[i]].begin();
        ans[i] = it->first;
        if (--it->second == 0) {
            candidates[a[i]].erase(it);
        }
        //if (candidates[a[i]].empty()) candidates.erase(a[i]);
    }

    //DUMP(a);
    //DUMP(ans);

    REP(i, n) {
        if (i) cout << ' ';
        cout << ans[i];
    }
    cout << endl;

    return 0;
}


Measured memory_bytes: 75944