#include <algorithm>
#include <array>
#include <iostream>
#include <vector>

using namespace std;

constexpr int N = 1e5;

array<int, 2> anc[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  fill(anc[0].begin(), anc[N].begin(), -1);
  vector<int> up(n), down(n), st, hv(n);
  for (auto& x: up) {
    cin >> x, --x;
    while (st.size() && st.back() < x) st.pop_back();
    if (st.size()) anc[x][0] = st.back();
    st.push_back(x);
  }
  st.clear();
  for (auto& x: down) {
    cin >> x, --x;
    while (st.size() && st.back() > x) st.pop_back();
    hv[x] = 1;
    if (~anc[x][0] && !hv[anc[x][0]]) return cout << "No\n", 0;
    if (st.size()) anc[x][!!~anc[x][0]] = st.back();
    st.push_back(x);
  }
  fill(hv.begin(), hv.end(), 0);
  for (auto& x: up) {
    hv[x] = 1;
    for (auto y: anc[x]) if (~y && !hv[y]) return cout << "nO\n", 0;
  }
  cout << "Yes\n";
  int ans = 0;
  for (int i = 0; i < n; ++i) for (auto j: anc[i]) if (~j) ++ans;
  cout << ans << '\n';
  for (int i = 0; i < n; ++i) for (auto j: anc[i]) if (~j) cout << j + 1 << ' ' << i + 1 << '\n';
}