from heapq import heappush, heappop
n = input()
m = [input() for i in xrange(n)]

dist = [10**7]*(1<<n)

que = [(0, 0, 0)]
while len(que):
    co, su, state = heappop(que)
    if dist[state] < co: continue
    for i in xrange(n):
        v = 1<<i
        if not state&v:
            n_co = co + max(0, m[i] - (su%1000))
            n_st = state|v
            if n_co < dist[n_st]:
                dist[n_st] = n_co
                heappush(que, (n_co, su+m[i], n_st))
print dist[(1<<n)-1]