import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto A = RDA(-1);
	auto B = RDA(-1);

	auto cnt1 = new long[](N);
	auto cnt2 = new long[](N);
	auto pos = new long[](N);
	foreach (i; 0..N)
	{
		++cnt1[A[i]];
		if (cnt1[A[i]] == 1)
		{
			pos[A[i]] = i;
		}
		++cnt2[B[i]];
	}
	debug writeln("cnt2:", cnt2);
	
	auto index = new long[](N);
	foreach (i; 0..N)
		index[i] = i;
	index.sort!((long a, long b) => cnt2[a] == cnt2[b] ? cnt1[a] > cnt1[b] : cnt2[a] > cnt2[b])();
	debug writeln(index);
	long end = -1;
	foreach (ii, i; index)
	{
		if (cnt2[i] == 0)
		{
			end = ii;
			break;
		}
	}
	if (end != -1)
	{
		index.length = end;
	}
	long ii, jj = 1;
	bool ok = true;
	auto ans = new long[](N);
	while (ii < index.length)
	{
		auto i = index[ii];
		auto j = index[jj];
		debug writeln("i:", i, " j:", j, " jj:", jj);
		debug writeln(cnt1);
		debug writeln(cnt2);
		if (i == j)
		{
			ok = false;
			break;
		}
		auto c1 = cnt1[j];
		auto c2 = cnt2[i];
		auto d = c2 - c1;
		if (d >= 0)
		{
			cnt1[j] = 0;
			cnt2[i] = d;
			auto p = pos[j];
			foreach (k; 0..c1)
			{
				ans[p+k] = i+1;
			}
			if (d == 0)
			{
				++ii;
			}
			else if (jj == 0)
			{
				ok = false;
				break;
			}
			++jj;
				
			if (index.length == jj)
			{
				jj = index[0];
				continue;
			}
		}
		else
		{
			cnt1[j] -= c2;
			cnt2[i] = 0;
			auto p = pos[j];
			foreach (k; 0..c2)
			{
				ans[p+k] = i+1;
			}
			pos[j] += c2;
			++ii;
		}
	}
	debug writeln("ii:", ii, " jj:", jj);

	if (ok)
	{
		writeln("Yes");
		ans.map!(to!string).join(" ").writeln;
	}
	else
	{
		writeln("No");
	}
	stdout.flush;
	debug readln;
}
