#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

void f(vector<int> &a, vector<int> &b)
{
  Yes(1);
  int n = a.size();
  rep(i, n)
  {
    rotate(b.begin(), b.begin() + 1, b.end());
    bool ok = true;
    rep(j, n)
    {
      if (a[j] == b[j])
        ok = false;
      break;
    }
    if (ok)
    {
      rep(j, n) cout << b[j] << (j == n - 1 ? "\n" : " ");
      return;
    }
  }
}

void solve()
{
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i, n)
  {
    cin >> a[i];
    a[i]--;
  }
  rep(i, n)
  {
    cin >> b[i];
    b[i]--;
  }
  vector<pii> pos1(n, MP(-1, -1)), pos2(n, MP(-1, -1));
  rep(i, n)
  {
    if (pos1[a[i]].first == -1)
      pos1[a[i]].first = i;
    pos1[a[i]].second = i;
    if (pos2[b[i]].first == -1)
      pos2[b[i]].first = i;
    pos2[b[i]].second = i;
  }
  int table[400010] = {};
  rep(i, n)
  {
    if (pos1[i].first == -1 or pos2[i].first == -1)
      continue;
    auto [l1, r1] = pos1[i];
    auto [l2, r2] = pos2[i];
    int L, R;
    if ((l2 <= l1 and l1 <= r2) or (l2 <= r1 and r1 <= r2))
      L = 0, R = r1 - l2;
    else if (r1 < l2)
      L = R = -1;
    else
      L = l1 - r2, R = r1 - l2;
    chmin(R, 2 * n);
    if (L >= 0)
      table[L]++, table[R + 1]--;
    l1 += n, r1 += n;
    if ((l2 <= l1 and l1 <= r2) or (l2 <= r1 and r1 <= r2))
      L = 0, R = r1 - l2;
    else if (r1 < l2)
      L = R = -1;
    else
      L = l1 - r2, R = r1 - l2;
    chmin(R, 2 * n);
    if (L >= 0)
      table[L]++, table[R + 1]--;
  }

  rep(i, n * 2) table[i + 1] += table[i];
  
  rep(i, n)
  {
    if (table[i] == 0 and table[i + n] == 0)
    {
      Yes(1);
      rotate(b.begin(), b.end() - i, b.end());
      rep(i, n) cout << b[i] + 1 << (i == n - 1 ? "\n" : " ");
      return;
    }
  }
  Yes(0);
}

int main()
{
  solve();
}


Measured memory_bytes: 9544