#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)




#ifdef _MSC_VER
#include <intrin.h>

#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>



using namespace std;
//using namespace atcoder;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
void Yes(bool cond) { cout << (cond ? "Yes" : "No") << '\n'; }
void YES(bool cond) { cout << (cond ? "YES" : "NO") << '\n'; }

int ca[200020], cb[200020];
using arr4 = array<int, 4>;
vector<int>pos[200020];
void solve() {
	int N, mx = 0;
	cin >> N;
	vector<int>A(N), B(N);
	REP(i, N)cin >> A[i];
	REP(i, N)cin >> B[i];
	vector<int>emp;
	REP(i, N) {
		ca[A[i]]++;
		cb[B[i]]++;
	}
	queue<int>safe;
	priority_queue<arr4>que;
	A.push_back(INF);
	int now = A[0];
	int cnt = 0;
	int l = 0;
	REP(i, N + 1) {
		if (now != A[i]) {
			if (!cb[now]) {
				FOR(j, l, i)safe.push(j);
			}
			else {
				que.push({ i - l,l,i,now });
			}
			now = A[i];
			l = i;
		}
	}
	vector<pii>v;
	REP(i, N + 1) {
		if (cb[i]) {
			v.push_back({ min(cb[i],ca[i]),i });
		}
	}
	VSORT(v); VREVERSE(v);
	for (auto p : v) {
		int val = p.second;
		arr4 tmp = { -1,-1,-1,-1 };
		while (!que.empty()&&cb[val]) {
			arr4 arr = que.top();
			que.pop();
			if (arr[3] == val) {
				tmp = arr; continue;
			}

			int cnt = arr[0], l = arr[1], r = arr[2], a = arr[3];
			if (cb[arr[3]] == 0) {
				FOR(i, l, r) {
					safe.push(i);
				}
				continue;
			}
			if (cnt >= cb[val]) {
				int idx = l;
				REP(_, cb[val]) {
					pos[val].push_back(l++);
				}
				cb[val] = 0;
				if (r > l)que.push({ r - l,l,r,a });
			}
			else {
				int idx = l;
				REP(_, cnt) {
					pos[val].push_back(l++);
				}
				cb[val] -= cnt;
			}
		}
		while (!safe.empty() && cb[val]) {
			int idx = safe.front(); safe.pop();
			pos[val].push_back(idx);
			cb[val]--;
		}
		if (cb[val]) {
			print("No"); return;
		}
		if (tmp[3] != -1)que.push(tmp);
	}
	vector<int>ans(N);
	print("Yes");
	REP(i, N + 1) {
		auto itr = pos[i].begin();
		while (itr != pos[i].end()) {
			ans[*itr] = i;
			itr++;
		}
	}
	print_space(ans);
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	//int q;
	//cin >> q;
	//while (q--)
	solve();

}



Measured memory_bytes: 31160