#include<bits/stdc++.h>
using namespace std;
#define mst(x,y) memset(x,y,sizeof(x))
#define rep(x,y,z) for(int x=(y);(x)<(z);x++)
const int maxn=100+10;
int n,a[maxn],b[maxn];
int nxt[maxn][2],flag=1,tmp=0;
int cnt[1000005];
void build(int l1,int r1,int l2,int r2,int pre){
if(l1>r1||l2>r2) return ;
///cout<<l1<<" "<<r1<<" "<<l2<<" "<<r2<<" "<<tmp<<endl;
if(a[l1]==b[r2]){
if(tmp){
flag=0;
///cout<<l1<<" "<<r1<<" "<<l2<<" "<<r2<<endl;
}
else tmp++;
nxt[pre][cnt[pre]++]=a[l1];
build(l1+1,r1,l2,r2-1,a[l1]);
}else{
tmp=0;
int idx=l2;while(b[idx]!=a[l1]) idx++;
int mov=idx-l2+1;
build(l1,l1+mov-1,l2,idx,pre);
build(l1+mov,r1,idx+1,r2,pre);
}
tmp=0;
return ;
}
vector<int> ans;
void dfs(int u){
if(u==-1) return ;
dfs(nxt[u][0]);
ans.push_back(u);
dfs(nxt[u][1]);
}
int main(){
mst(nxt,-1);
ios::sync_with_stdio(false);
cin>>n;
rep(i,1,n+1) cin>>a[i];
rep(i,1,n+1) cin>>b[i];
build(1,n,1,n,0);
if(flag) cout<<"Yes\n";
else cout<<"No\n";
dfs(a[1]);
rep(i,0,ans.size()){
cout<<ans[i];
if(i!=ans.size()-1) cout<<" ";
else cout<<"\n";
}
return 0;
}