local bls, brs = bit.lshift, bit.rshift
local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max

local n = io.read("*n")
local cost = {}
for i = 1, n do
  cost[i] = io.read("*n")
end
local maxhp = {}
local tot = bls(1, n)
for i = 1, tot - 1 do
  local lv = 1
  local ti = i
  for j = 1, n do
    if ti % 2 == 1 then
      if cost[j] < 0 then
        lv = lv + 1
      end
    end
    ti = brs(ti, 1)
  end
  maxhp[i] = 100 * lv
end

local function bdp_prepare()
  local alltask = {}
  local stagetask = {}
  for i = 1, n do
    stagetask[i] = {}
  end
  for i = 1, tot - 1 do
    alltask[i] = 0
  end
  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
  -- set first state
  local tmp = 1
  for i = 1, n do
    if cost[i] < 0 then
      alltask[tmp] = mma(0, 100 + cost[i])
    else
      alltask[tmp] = 100
    end
    tmp = tmp * 2
  end
  return alltask, stagetask
end

local function bdp_doall(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
      if 0 < alltask[used] then
        for j = 1, n do
          if tmp % 2 == 0 then
            local nxt = 0
            if cost[j] < 0 then
              nxt = mma(0, alltask[used] + cost[j])
            else
              nxt = mmi(maxhp[used], alltask[used] + cost[j])
            end
            alltask[used + mul] = mma(alltask[used + mul], nxt)
          else
            tmp = tmp - 1
          end
          tmp = tmp / 2
          mul = mul * 2
        end
      end
    end
  end
end

local function bdp_getresult(alltask)
  return alltask[tot - 1]
end

local alltask, stagetask = bdp_prepare()
bdp_doall(alltask, stagetask)
local ret = bdp_getresult(alltask)
print(ret)