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

const int MAXN = 1e5 + 10;

int n, a[MAXN], b[MAXN], in[MAXN], ind1[MAXN], ind2[MAXN];
vector<pair<int, int>> res;
vector<int> adj[MAXN];
bool seen[MAXN];

void input() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		ind1[a[i]] = i;
	}
	for (int i = 1; i <= n; i++) {
		cin >> b[i];
		ind2[b[i]] = i;	
	}
	ind1[n + 1] = ind2[n + 1] = 1e9;
}

struct node {
	int mi1 = n + 1, mi2 = n + 1;	
};

node seg[4 * MAXN];

node merge(node s1, node s2) {
	node res;
	res.mi1 = (ind1[s1.mi1] < ind1[s2.mi1]? s1.mi1: s2.mi1);
	res.mi2 = (ind2[s1.mi2] < ind2[s2.mi2]? s1.mi2: s2.mi2);
	return res;	
}

void make(int u, int l, int r) {
	if (r - l == 1) {
		seg[u] = {b[l], a[l]};
		return;	
	}
	int mid = (l + r) / 2;
	make(2 * u, l, mid);
	make(2 * u + 1, mid, r);
	seg[u] = merge(seg[2 * u], seg[2 * u + 1]);
}

node get(int u, int l, int r, int s, int e) {
	if (s <= l && r <= e)
		return seg[u];
	if (e <= l || r <= s)
		return {n + 1, n + 1};
	int mid = (l + r) / 2;
	return merge(get(2 * u, l, mid, s, e), get(2 * u + 1, mid, r, s, e));
}

bool topol() {
	queue<int> q;
	for (int i = 1; i <= n; i++)
		if (in[i] == 0) {
			q.push(i);
			seen[i] = true;	
		}
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		for (auto v : adj[u]) {
			in[v]--;
			if (in[v] == 0) {
				q.push(v);
				seen[v] = true;
			}	
		}
	}
	for (int i = 1; i <= n; i++)
		if (!seen[i])
			return false;
	return true;
}

void findAns() {
	vector<int> st1, st2;
	st1.push_back(1);
	st2.push_back(1);
	for (int i = 2; i <= n; i++) {
		while (!st1.empty() && a[i] > a[st1.back()])
			st1.pop_back();
		if (!st1.empty()) {
			int l = st1.back();
			node x = get(1, 1, n + 1, l, i);
			if (ind2[x.mi2] > ind2[a[i]]) {
				cout << "NO" << endl;
				return;	
			}
			res.push_back({x.mi2, a[i]});
			adj[x.mi2].push_back(a[i]);
			in[a[i]]++;
		}
		st1.push_back(i);
		while (!st2.empty() && b[i] < b[st2.back()])
			st2.pop_back();
		if (!st2.empty()) {
			int l = st2.back();
			node x = get(1, 1, n + 1, l, i);
			if (ind1[x.mi1] > ind1[b[i]]) {
				cout << "NO" << endl;
				return;	
			}
			res.push_back({x.mi1, b[i]});
			adj[x.mi1].push_back(b[i]);
			in[b[i]]++;
		}
		st2.push_back(i);
	}
	if (topol()) {
		cout << "YES" << endl << res.size() << endl;
		for (auto p : res)
			cout << p.first << " " << p.second << endl;
		return;	
	}
	cout << "NO" << endl;
	return;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	input();
	make(1, 1, n + 1);
	findAns();
	return 0;
}