#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a,ll m=mod) {
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,ll m=mod){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}
ll N,M,K;
string s,t;
ll ans;
int main(){
  startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j,k,maxid;
  cin>>N;
  vec a(N),b(N),cnta(N,0),cntb(N,0),v;
  rep(i,N){
    cin>>a[i];++cnta[--a[i]];
  }
  rep(i,N){
    cin>>b[i];++cntb[--b[i]];
  }
  rep(i,N){
    if(cnta[i]+cntb[i]>N)break;
    K=min(cnta[i],cntb[i]);
    cnta[i]-=K;
    cntb[i]-=K;
    if(chmax(M,K))maxid=i;
    rep(j,K)v.eb(i);
  }
  if(i<N){
    printno;
    return 0;
  }
  printyes;
  vec ansa(N,0),ansb(N,0);
  K=v.size();
  if(M*2<=K){
    rep(i,K){
      ansa[i]=v[i]+1;
      ansb[i]=v[(i+M)%K]+1;
    }
    j=K;
    rep(k,N){
      while(cnta[k]--){
        ansa[i++]=k+1;
      }
      while(cntb[k]--){
        ansb[j++]=k+1;
      }
    }
    assert(i==N&&i==j);
  }else{
    rep(i,K)if(v[i]==maxid)v[i]=inf;
    vsort(v);
    rep(i,K-M){
      ansa[i]=v[i]+1;
      ansb[i]=maxid+1;
      ansb[i+K-M]=v[i]+1;
      ansa[i+K-M]=maxid+1;
    }
    //first (K-M)*2 ok
    i=(K-M)*2;

    M-=K-M;
    //M nokori

    k=M;
    rep(j,N){
      if(j==maxid||!cnta[j])continue;
      while(k&&cnta[j]){
        k--;cnta[j]--;
        ansa[i]=j+1;
        ansb[i++]=maxid+1;
      }
      if(!k)break;
    }
    k=M;
    rep(j,N){
      if(j==maxid||!cntb[j])continue;
      while(k&&cntb[j]){
        k--;cntb[j]--;
        ansb[i]=j+1;
        ansa[i++]=maxid+1;
      }
      if(!k)break;
    }
    // return 0;
    j=i;
    rep(k,N){
      while(cnta[k]--){
        ansa[i++]=k+1;
      }
      while(cntb[k]--){
        ansb[j++]=k+1;
      }
    }
  }

  // output(ansa);
  // output(ansb);
  pvec ans(N);
  rep(i,N)ans[i]=datas(ansa[i],ansb[i]);
  vsort(ans);
  rep(i,N)ansb[i]=ans[i].second;
  output(ansb);
}

Measured memory_bytes: 17460