nn = gets.to_i
ss = gets.split.map(&:to_i).sort{|a,b|b<=>a}

if nn==1
  puts ss[0]!=ss[1] ? 'Yes' : 'No'
  exit
end

# 仮想最大配列を生成。これの全要素が入力要素以上ならOK
vmax = [ss[0]]
1.upto(nn) do
  vmax = vmax + vmax.map{|i|i-1}
end
vmax.sort!{|a,b|b<=>a}

can = true
ss.size.times do |i|
  diff = vmax[i]-ss[i]
  if diff < 0
    can = false
    break
  end
end

puts can ? 'Yes' : 'No'