#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

int main() {
    int N;
    cin >> N;
    vector<int> A(N), B(N), C(N + 1, 0), D(N + 1, 0), E(N + 1, 0), F(N + 1, 0);
    rep(i, N) {
        cin >> A[i];
        E[A[i]]++;
    }
    rep(i, N) {
        cin >> B[i];
        F[B[i]]++;
    }
    rep(i, N) {
        if (E[i + 1] + F[i + 1] > N) {
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
    rep(i, N) {
        C[i + 1] = C[i] + E[i + 1];
        D[i + 1] = D[i] + F[i + 1];
    }
    int x = -N;
    rep(i, N) {
        x = max(x, C[i + 1] - D[i]);
    }
    rep(i, N) {
        cout << B[(i - x + N) % N];
        if (i == N - 1) cout << "\n";
        else cout << " ";
    }
}