def inpf() a=gets.chomp.split(" ").map(&:to_f)end

def inps() a=gets.chomp.split(" ")end

def copy(a) Marshal.load(Marshal.dump(a)) end

def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end

def na(n,d=0) Array.new(n,d)end

def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end

def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

def inp() a=gets.chomp.split(" ").map(&:to_i)end

def r_up(a, b) (a+b-1)/b end

def sum(a) a.inject(:+) end

n = inp[0]
t = inp
h = Hash.new(0)
t.each do |d|
  h[d] += 1
end
t = t.uniq.sort.reverse
f = true
if(h[t[0]] != 1)
  f = false
end
tree = na(n)
max = []
n.times{|i|max[i] = 2**i}
t.shift
t.each do |d|
  able = 1
  stock = h[d]
  n.times do |i|
    plable = tree[i]
    if(tree[i]<max[i])
      note = [[max[i]-tree[i], able-tree[i], stock].min, 0].max
      tree[i] += note
      stock -= note
    end
    able += plable
  end
  f = false if(stock != 0)
end
puts (f)? "Yes" : "No"
