local function bdp_prepare(n)
  local tot = 1
  local alltask = {}
  local stagetask = {}
  for i = 1, n do
    tot = tot * 2
    stagetask[i] = {}
  end
  local a = {}
  local a0 = io.read("*n")
  for i = 1, tot - 1 do
    a[i] = io.read("*n")
    if a[i] < a0 then
      alltask[i] = {tot, i}
    else
      alltask[i] = {i, tot}
    end
  end
  a[tot] = a0
  for i = 1, tot - 1 do
    local ti = i
    local cnt = 0
    for j = 1, n do
      if ti % 2 == 1 then
        cnt = cnt + 1
        ti = ti - 1
      end
      ti = ti / 2
    end
    table.insert(stagetask[cnt], i)
  end
  return tot, a, alltask, stagetask
end

local function bdp_walk(a, alltask, src, dst)
  local dst1 = alltask[dst][1]
  local dst2 = alltask[dst][2]
  local src1 = alltask[src][1]
  local src2 = alltask[src][2]
  local tmp = {dst1, dst2, src1, src2}
  table.sort(tmp, function(x, y) return a[x] > a[y] end)
  for i = 4, 2, -1 do
    if tmp[i] == tmp[i - 1] then
      table.remove(tmp, i)
    end
  end
  alltask[dst][1] = tmp[1]
  alltask[dst][2] = tmp[2]
end

local function bdp_doall(n, a, alltask, stagetask)
  for stage = 1, n - 1 do
    local stlen = #stagetask[stage]
    for i_stagetask = 1, stlen do
      local used = stagetask[stage][i_stagetask]
      local mul = 1
      local tmp = used
      for j = 1, n do
        if tmp % 2 == 0 then
          bdp_walk(a, alltask, used, used + mul)
        else
          tmp = tmp - 1
        end
        tmp = tmp / 2
        mul = mul * 2
      end
    end
  end
end

local n = io.read("*n")
local tot, a, alltask, stagetask = bdp_prepare(n)
bdp_doall(n, a, alltask, stagetask)
local prv = 0
for i = 1, tot - 1 do
  local cur = a[alltask[i][1]] + a[alltask[i][2]]
  if cur < prv then cur = prv end
  print(cur)
  prv = cur
end
