#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <set>
#include <map>

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 
};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/cpp_programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = decltype(std::rbegin(std::declval<T>()));

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }
};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 19 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  i32 N;
  std::cin >> N;
  std::vector<i32> A(N), B(N);
  for (auto &x: A) {
    std::cin >> x;
  }
  for (auto &x: B) {
    std::cin >> x;
  }
  std::map<i32, i32> cntA;
  for (const auto x: A) {
    cntA[x]++;
  }
  std::map<i32, i32> cntB;
  for (const auto x: B) {
    cntB[x]++;
  }
  std::set<std::pair<i32, i32>> border;
  for (const auto &[num, cnt]: cntA) {
    const auto sum = cnt + cntB[num];
    if (sum > N) {
      std::cout << "No\n";
      return 0;
    }
    border.emplace(N - sum, num);
  }
  for (auto itr = cntB.begin(); itr != cntB.end();) {
    if (itr -> second == 0) {
      itr = cntB.erase(itr);
    }
    else {
      ++itr;
    }
  }
  i32 cur = 0;
  std::vector<i32> ans;
  for (auto &[num, cnt]: cntA) {
    i32 cntb = 0;
    if (auto itr = cntB.find(num); itr != cntB.end()) {
      cntb = itr -> second;
      cntB.erase(itr);
    }
    if (auto itr = border.find(std::make_pair(N - cntA[num] - cntb, num)); itr != border.end()) {
      border.erase(itr);
    }
    i32 remain = cnt;
    if (auto itr = border.begin(); itr != border.end()) {
      auto [bd, nm] = *itr;
      border.erase(itr);
      if (cur + cnt > bd) {
        auto size = cur + cnt - bd;
        bd += size;
        cntB[nm] -= size;
        remain -= size;
        while (size--) {
          ans.push_back(nm);
        }
      }
      border.emplace(bd, nm);
    }
    for (auto itr = cntB.begin(); itr != cntB.end() && remain > 0;) {
      auto &[nm, ct] = *itr;
      border.erase(std::make_pair(N - cntA[nm] - ct, nm));
      auto size = std::min(ct, remain);
      remain -= size;
      ct -= size;
      while (size--) {
        ans.push_back(nm);
      }
      border.emplace(N - cntA[nm] - ct, nm);
      if (ct == 0) {
        itr = cntB.erase(itr);
      }
      else {
        ++itr;
      }
    }
    cur += cnt;
    cnt = 0;
    border.emplace(N - cntA[num] - cntb, num);
    if (cntb > 0) {
      cntB[num] = cntb;
    }
  }
  std::cout << "Yes\n";
  for (auto x: ans) {
    std::cout << x << ' ';
  }
  std::cout << '\n';
  return 0;
}


Measured memory_bytes: 33088