def solve(N, A):
    dp = [[float("inf")] * 1000 for _ in range(1 << N)]
    dp[0][0] = 0
    for V in range(1 << N):
        for i in range(N):
            if (V >> i) & 1:
                continue
            VV = V | (1 << i)
            for r in range(1000):
                buy = max(0, A[i] - r)
                rr = (r + A[i]) % 1000
                dp[VV][rr] = min(dp[VV][rr], dp[V][r] + buy)

    return min(dp[-1])


def main():
    N = int(input())
    A = [int(input()) for _ in range(N)]
    ans = solve(N, A)
    print(ans)


if __name__ == "__main__":
    main()