#!/usr/bin/env python3

INF = 1 << 24


def solve(n, ms):
    dp = [INF for _ in range(1 << n)]
    # 何も選ばなければ合計0
    dp[0] = 0
    for s in range((1 << n) - 1):
        discount = sum(ms[i] for i in range(n) if s & (1 << i) > 0) % 1000
        for i in range(n):
            if s & (1 << i) == 0:
                dp[s | (1 << i)] = min(dp[s | (1 << i)],
                                       dp[s] + max(0, ms[i] - discount))
    return dp[(1 << n) - 1]


def main():
    n = int(input())
    ms = [int(input()) for _ in range(n)]
    print(solve(n, ms))


if __name__ == '__main__':
    main()