#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, a[maxn], b[maxn], df[maxn], dg[maxn], tp[maxn], tot;
vector<pair<int, int> > edges;
vector<int>F[maxn], G[maxn];
set<int> s;
void Add(int u, int v) {
	edges.push_back({u, v});
	G[u].push_back(v);
	++ dg[v];
	F[u].push_back(v);
	++ df[v];
}
priority_queue<int, vector<int>, greater<int> > qg;
int Topo1() {
	tot = 0;
	for(int i = 1; i <= n; ++ i) {
		if(!dg[i])
			qg.push(i);
	}
	while(!qg.empty()) {
		int u = qg.top();
		tp[++ tot] = u;
		qg.pop();
		for(auto v : G[u]) {
			if(!(-- dg[v])) {
				qg.push(v);
			}
		}
	}
	if(tot < n)
		return 0;
	for(int i = 1; i <= n; ++ i)
		if(tp[i] != a[i])
			return 0;
	return 1;
}
priority_queue<int> qf;
int Topo2() {
	tot = 0;
	for(int i = 1; i <= n; ++ i) {
		if(!df[i])
			qf.push(i);
	}
	while(!qf.empty()) {
		int u = qf.top();
		tp[++ tot] = u;
		qf.pop();
		for(auto v : F[u]) {
			if(!(-- df[v])) {
				qf.push(v);
			}
		}
	}
	if(tot < n)
		return 0;
	for(int i = 1; i <= n; ++ i)
		if(tp[i] != b[i])
			return 0;
	return 1;
}
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++ i) {
		scanf("%d", &a[i]);
	}
	for(int i = 1; i <= n; ++ i) {
		scanf("%d", &b[i]);
	}
	s.clear();
	for(int i = n; i; -- i) {
		while(s.size() && *s.begin() < a[i]) {
			Add(a[i], *s.begin());
			s.erase(s.begin());
		}
		s.insert(a[i]);
	}
	s.clear();
	for(int i = n; i; -- i) {
		while(s.size() && *prev(s.end()) > b[i]) {
			Add(b[i], *prev(s.end()));
			s.erase(prev(s.end()));
		}
		s.insert(b[i]);
	}
	if(!Topo1())
		return 0 * puts("No");
	if(!Topo2())
		return 0 * puts("No");
	puts("Yes");
	printf("%d\n", (int)edges.size());
	for(auto [u, v] : edges)
		printf("%d %d\n", u, v);
}