n=gets.to_i
l=[0]*200001
a=gets.split.map(&:to_i)
b=gets.split.map(&:to_i)
a.each do |c|
  l[c]+=1
end
b.each do |c|
  l[c]+=1
end
lm=l.max
if lm>n
  puts "No"
  exit
else
  puts "Yes"
end
li=l.index(lm)
if !a.include?(li)||a.reverse.index(li)==0
  k=0
else
  k=n-a.reverse.index(li)
end
i,j=0,0
s=[]
jz=n
while i<n
  if b[j]&&a[(i+k)%n]!=b[j]
    s << b[j]
    b[j]=nil
    i+=1
  end
  j+=1
  if j==jz
    j=0
    b.delete(nil)
  end
end
if k==0
  bb=s
else
  bb=s[(n-k)..(n-1)]+s[0..(n-k)-1]
end
puts bb.join(" ")