/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.05.27 20:03:41
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n;cin >> n;
    vector<int> m(n);
    for (int i = 0; i < n; i++) {
        cin >> m[i];
    }
    constexpr long long LLINF = 1e18 + 1;
    vector<int> sum(1<<n,0);
    vector<ll> dp(1<<n,LLINF);
    dp[0] = 0;
    for (int i = 0; i < 1<<n; i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                sum[i] += m[j];
            }
        }
        sum[i] %= 1000;
    }
    for (int i = 1; i < 1<<n; i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                dp[i] = min(dp[i],dp[i ^ (1 << j)] + max(0,m[j] - sum[i^(1<<j)]));
            }
        }
    }
    cout << dp[(1<<n)-1] << endl;
    return 0;
}