#include <bits/stdc++.h>

#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC                      \
  ios_base::sync_with_stdio(false); \
  cin.tie(0);                       \
  cout.tie(0)
#define pb push_back
#define vi vector<int>
#define vii vector<ii>
#define all(x) x.begin(), x.end()
#define EPS 1e-9
#define INF 1e18
#define ROOT 1
#define M 1000000007
#define curtime chrono::steady_clock::now().time_since_epoch().count
#define rep(i, beg, n, s) for (int i = beg; i < n; i += s)
const double PI = acos(-1);

using namespace std;

inline int mod(int n, int m = M) {
  int ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}

int exp(int n, int k) {
  if (k == 0) return 1;
  if (k == 1) return n;
  int ax = exp(n, k / 2);
  ax = mod(ax * ax);
  if (k % 2) ax = mod(ax * n);
  return ax;
}

int gcd(int a, int b) {
  if (a == 0)
    return b;
  else
    return gcd(b % a, a);
}
int ans[212345];
int n;

bool solve(vector<ii>& a, vector<int>& b) {
  sort(all(a));
  sort(all(b));
  reverse(all(b));
  for (int i = 0; i < n; i++) {
    if (a[i].ff != b[i]) {
      ans[a[i].ss] = b[i];
      continue;
    }
    int l = i;
    int r = n - 1;
    int id = -1;
    while (l <= r) {
      // gets first different
      int m = (l + r) >> 1;
      if (b[m] != b[i]) {
        id = m;
        r = m - 1;
      } else
        l = m + 1;
    }
    if (id == -1) {
      return false;
    }

    swap(b[i], b[id]);
    ans[a[i].ss] = b[i];
  }
  return true;
}

bool solve_rev(vector<ii>& a, vector<int>& b) {
  sort(all(a));
  sort(all(b));
  for (int i = 0; i < n; i++) {
    if (a[i].ff != b[i]) {
      ans[a[i].ss] = b[i];
      continue;
    }
    int l = i;
    int r = n - 1;
    int id = -1;
    while (l <= r) {
      // gets first different
      int m = (l + r) >> 1;
      if (b[m] != b[i]) {
        id = m;
        r = m - 1;
      } else
        l = m + 1;
    }
    if (id == -1) {
      return false;
    }

    swap(b[i], b[id]);
    ans[a[i].ss] = b[i];
  }
  return true;
}

bool solve_brutal(vector<ii>& a, vector<int>& b) {
  sort(all(a));
  sort(all(b));
  reverse(all(b));
  for (int i = 0; i < n; i++) {
    if (a[i].ff != b[i]) {
      ans[a[i].ss] = b[i];
      continue;
    }
    int l = i;
    int r = n - 1;
    int id = -1;
    while (l <= r) {
      // gets first different
      int m = (l + r) >> 1;
      if (b[m] != b[i]) {
        id = m;
        r = m - 1;
      } else
        l = m + 1;
    }
    if (id != -1) {
      swap(b[i], b[id]);
      ans[a[i].ss] = b[i];
      continue;
    }

    bool ok = false;
    for (int j = 0; j < i; j++) {
      if (a[j].ff != a[i].ff && ans[a[j].ss] != a[i].ff) {
        ans[a[i].ss] = ans[a[j].ss];
        ans[a[j].ss] = b[i];
        ok = true;
        break;
      }
    }

    if (ok) continue;
    return false;
  }
  return true;
}

//#define MULTIPLE_TEST_CASE
void solution() {
  cin >> n;
  vector<ii> a(n);
  vector<int> b(n);
  int id = 0;
  for (ii& x : a) cin >> x.ff, x.ss = id++;
  id = 0;
  for (int& x : b) cin >> x;
  if (solve_rev(a, b)) {
    cout << "Yes" << endl;
    for (int i = 0; i < n; i++) cout << ans[i] << " ";
    cout << endl;
  } else if (solve(a, b)) {
    cout << "Yes" << endl;
    for (int i = 0; i < n; i++) cout << ans[i] << " ";
    cout << endl;
  } else if (solve_brutal(a, b)) {
    cout << "Yes" << endl;
    for (int i = 0; i < n; i++) cout << ans[i] << " ";
    cout << endl;
  } else {
    cout << "No" << endl;
  }
}

int32_t main() {
  DESYNC;
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  int t = 1;
#ifdef MULTIPLE_TEST_CASE
  cin >> t;
#endif
  while (t--) solution();
}


Measured memory_bytes: 9548