//Shirasu Azusa 2024.5
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=1e5+5;
int a[N],b[N],c[N],n,d[N],f[N],g[N],deg[N],tick;
vi e[N]; vp ans; map<pii,int>ed;
priority_queue<int> q;

pii s1[N];
void add1(int x,pii y) {for(;x<=n;x+=x&-x) chmax(s1[x],y);}
pii qry1(int x,pii y=mp(0,0)) {for(;x;x-=x&-x) chmax(y,s1[x]); return y;}

signed main() {
  n=read();
  rep(i,1,n) c[i]=read(), a[c[i]]=i;  
  rep(i,1,n) d[i]=read(), b[d[i]]=i;
  pii mn(N,N);
  rep(i,1,n) {
    int u=c[i]; static int r[N]; int t=2;
    r[0]=mn.se, r[1]=qry1(b[u]).se;
    rep(i,0,t-1) if(1<=r[i]&&r[i]<=n&&b[r[i]]<b[u]) {
      if(ed.count(pii(r[i],u))) continue; ed[pii(r[i],u)]=1;
      ans.eb(r[i],u); e[r[i]].eb(u);
    }
    chmin(mn,pii(b[u],u));
    add1(b[u],pii(b[u],u));
  }
  rep(i,0,n) s1[i]=pii(0,0); mn=pii(N,N);
  rep(i,1,n) {
    int u=d[i]; static int r[N]; int t=2;
    r[0]=mn.se, r[1]=qry1(a[u]).se;
    rep(i,0,t-1) if(1<=r[i]&&r[i]<=n&&a[r[i]]<a[u]) {
      if(ed.count(pii(r[i],u))) continue; ed[pii(r[i],u)]=1;
      ans.eb(r[i],u); e[r[i]].eb(u);
    }
    chmin(mn,pii(a[u],u));
    add1(a[u],pii(a[u],u));
  }

  rep(i,1,n) for(int j:e[i]) ++deg[j];
  rep(i,1,n) if(!deg[i]) q.push(-i);
  while(!q.empty()) {
    int u=-q.top(); q.pop(); f[++tick]=u;
    for(int v:e[u]) if(!--deg[v]) q.push(-v);
  } tick=0;
  rep(i,1,n) assert(!deg[i]);
  rep(i,1,n) for(int j:e[i]) ++deg[j];
  rep(i,1,n) if(!deg[i]) q.push(i);
  while(!q.empty()) {
    int u=q.top(); q.pop(); g[++tick]=u;
    for(int v:e[u]) if(!--deg[v]) q.push(v);
  }
  rep(i,1,n) if(c[i]!=f[i]) return puts("No"), 0;
  rep(i,1,n) if(d[i]!=g[i]) return puts("No"), 0;
  puts("Yes");
  assert(ans.size()<=min(n*(n-1)/2,1000000ll));
  printf("%lld\n",(int)ans.size());
  for(auto [x,y]:ans) printf("%lld %lld\n",x,y);
  return 0;
}