#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e13;
const int MAX = 510000;
bool graph[nmax][nmax];
long long fac[MAX], finv[MAX], inv[MAX];

void COMinit()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++)
    {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

ll COM(int n, int k)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;

    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
struct SegmentTree
{
private:
    ll n;
    vector<ll> node;

public:
    SegmentTree(vector<ll> v)
    {
        ll sz = v.size();
        n = 1;
        while (n < sz)
        {
            n *= 2;
        }
        node.resize(2 * n - 1, INF);

        for (ll i = 0; i < sz; i++)
        {
            node[i + n - 1] = v[i];
        }

        for (ll i = n - 2; i >= 0; i--)
        {
            node[i] = min(node[2 * i + 1], node[2 * i + 2]);
        }
    }
    void update(ll x, ll val)
    {
        x += (n - 1);
        node[x] = val;
        while (x > 0)
        {
            x = (x - 1) / 2;
            node[x] = min(node[2 * x + 1], node[2 * x + 2]);
        }
    }

    // findは半開区間で考える
    ll find(ll a, ll b, ll k = 0, ll l = 0, ll r = -1)
    {
        if (r < 0)
            r = n;

        if (r <= a || b <= l)
            return INF;

        if (a <= l && r <= b)
            return node[k];

        ll vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
        ll vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
        return min(vl, vr);
    }
};
void warshall_floyd(ll n)
{
    for (size_t i = 0; i < n; i++)
    {
        for (size_t j = 0; j < n; j++)
        {
            for (size_t k = 0; k < n; k++)
            {
                dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
            }
        }
    }
}

class UnionFind
{
public:
    vector<ll> Parent;

    UnionFind(ll N)
    {
        Parent = vector<ll>(N, -1);
    }
    ll find(ll A)
    {
        if (Parent[A] < 0)
            return A;
        return Parent[A] = find(Parent[A]);
    }

    ll size(ll A)
    {
        return -Parent[find(A)];
    }

    bool Union(ll A, ll B)
    {
        A = find(A);
        B = find(B);
        if (A == B)
        {
            return false;
        }
        if (size(A) < size(B))
            swap(A, B);

        Parent[A] += Parent[B];
        Parent[B] = A;

        return true;
    }
};

ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b)
{
    ll g = gcd(a, b);
    return a / g * b;
}

ll mulMod(ll a, ll b)
{
    return (((a % MOD) * (b % MOD)) % MOD);
}

ll powMod(ll a, ll p)
{
    if (p == 0)
    {
        return 1;
    }
    else if (p % 2 == 0)
    {
        ll half = powMod(a, p / 2);
        return mulMod(half, half);
    }
    else
    {
        return mulMod(powMod(a, p - 1), a);
    }
}

ll ceil(ll a, ll b)
{
    return (a + b - 1) / b;
}

vector<ll> tsort(Graph G)
{
    ll N = G.size();
    vector<ll> in(N);
    for (auto &&edges : G)
    {
        for (auto &&edge : edges)
        {
            in[edge]++;
        }
    }

    queue<int> que;

    for (int i = 0; i < N; i++)
    {
        if (in[i] == 0)
        {
            que.push(i);
        }
    }
    int cnt = 0;
    vector<ll> ans;
    while (!que.empty())
    {
        int v = que.front();
        que.pop();
        ans.push_back(v);
        for (auto &&next : G[v])
        {

            in[next]--;
            if (in[next] == 0)
            {
                que.push(next);
            }
        }
    }
    return ans;
}

const string YES = "Yes";
const string NO = "No";

void another(ll N, vector<ll> A, vector<ll> B)
{
    map<ll, ll> cntA, cntB;
    for (int i = 0; i < N; i++)
    {
        cntA[A[i]]++;
        cntB[B[i]]++;
    }

    for (int i = 1; i <= N; i++)
    {
        ll remain = N - cntA[i];
        if (remain < cntB[i])
        {
            cout << "No" << endl;
            return;
        }
    }
    vector<ll> newA(N * 2, 0);
    RSORT(B);
    for (int i = 0; i < N; i++)
    {
        newA[i] = A[i];
        newA[i + N] = A[i] + N;
    }

    vector<ll> ans(N * 2, 0);
    ll prev_index = 0;
    for (int i = N; i >= 1; i--)
    {
        if (cntB[i] > 0)
        {
            auto Ite = upper_bound(newA.begin(), newA.end(), i);
            ll index = Ite - newA.begin();
            if (index == N)
            {
                index = 0;
            }
            ll remain = cntB[i];

            while (remain > 0)
            {
                if (ans[index] == 0)
                {
                    if (index < N)
                    {
                        ans[index] = i;
                        ans[index + N] = i;
                    }
                    else
                    {
                        ans[index] = i;
                        ans[index - N] = i;
                    }
                    remain--;
                    index++;
                    index %= N * 2;
                }
                else
                {
                    index++;
                    index %= N * 2;
                }
            }
        }
    }
    for (int i = 0; i < N; i++)
    {
        if (ans[i] == newA[i])
        {
            another(N, std::move(A), std::move(B));
            return;
        }
    }

    cout << "Yes" << endl;
    for (int i = 0; i < N; i++)
    {
        cout << ans[i] << " ";
    }
    cout << endl;
}
void solve(long long N, std::vector<long long> A, std::vector<long long> B)
{
    map<ll, ll> cntA, cntB;
    for (int i = 0; i < N; i++)
    {
        cntA[A[i]]++;
        cntB[B[i]]++;
    }

    for (int i = 1; i <= N; i++)
    {
        ll remain = N - cntA[i];
        if (remain < cntB[i])
        {
            cout << "No" << endl;
            return;
        }
    }
    vector<ll> newA(N * 2, 0);
    RSORT(B);
    for (int i = 0; i < N; i++)
    {
        newA[i] = A[i];
        newA[i + N] = A[i] + N;
    }

    vector<ll> ans(N * 2, 0);
    ll prev_index = 0;
    for (int i = 1; i <= N; i++)
    {
        if (cntB[i] > 0)
        {
            auto Ite = upper_bound(newA.begin(), newA.end(), i);
            ll index = Ite - newA.begin();
            if (index == N)
            {
                index = 0;
            }
            ll remain = cntB[i];

            while (remain > 0)
            {
                if (ans[index] == 0)
                {
                    if (index < N)
                    {
                        ans[index] = i;
                        ans[index + N] = i;
                    }
                    else
                    {
                        ans[index] = i;
                        ans[index - N] = i;
                    }
                    remain--;
                    index++;
                    index %= N * 2;
                }
                else
                {
                    index++;
                    index %= N * 2;
                }
            }
        }
    }
    for (int i = 0; i < N; i++)
    {
        if (ans[i] == newA[i])
        {
            another(N, std::move(A), std::move(B));
            return;
        }
    }

    cout << "Yes" << endl;
    for (int i = 0; i < N; i++)
    {
        cout << ans[i] << " ";
    }
    cout << endl;
}

int main()
{
    long long N;
    scanf("%lld", &N);
    std::vector<long long> A(N);
    for (int i = 0; i < N; i++)
    {
        scanf("%lld", &A[i]);
    }
    std::vector<long long> B(N);
    for (int i = 0; i < N; i++)
    {
        scanf("%lld", &B[i]);
    }

    // for (int a = 0; a < 3; a++)
    // {
    //     for (int b = 0; b < 3; b++)
    //     {
    //         for (int c = 0; c < 3; c++)
    //         {
    //             for (int d = 0; d < 3; d++)
    //             {
    //                 for (int e = 0; e < 3; e++)
    //                 {
    //                     for (int f = 0; f < 3; f++)
    //                     {
    //                             vector<ll> A(3),B(3);

    //                         A[0] = a + 1;
    //                         A[1] = b + 1;
    //                         A[2] = c + 1;
    //                         B[0] = d + 1;
    //                         B[1] = e + 1;
    //                         B[2] = f + 1;
    //                         SORT(A);
    //                         SORT(B);
    //                         cout << A[0] << " " << A[1] << " " << A[2] << endl;
    //                         cout << B[0] << " " << B[1] << " " << B[2] << endl;
    //                         solve(3,move(A),move(B));
    //                         cout << endl;
    //                     }
    //                 }
    //             }
    //         }
    //     }
    // }

    solve(N, std::move(A), std::move(B));
    return 0;
}


Measured memory_bytes: 69004