# Here your code !
INF = 1 << 28
n = gets.to_i
m = n.times.map { gets.to_i }
S = 1 << n
P = Array.new(S,0) 
dp = Array.new(S,INF)
dp[0] = 0
m.each_with_index.each_with_object({0 => 0}) do |(v,i),o|
    mask = 1 << i
    o.keys.each do |s|
        if s & mask == 0
            P[s | mask] = o[ s | mask ] = o[s] + v
        end
    end
end
S.times do |s|
    n.times do |i|
        mask = 1 << i
        if s & mask == 0
            buy = m[i] - (P[s] % 1000)
            sum = dp[s] + (buy < 0 ? 0 : buy)
            dp[s | mask] = sum if sum < dp[s | mask]
        end
    end
end
puts dp[S-1]