#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1e5;
ll MOD = 1e3;

int main(){
    int N;
    cin >> N;

    int dp[1<<N];
    rep(i,0,1<<N) dp[i] = INF;
    dp[0] = 0;

    int tot[1<<N];
    tot[0] = 0;

    int product[N];
    rep(i,0,N) cin >> product[i];

    rep(msk,0,1<<N) rep(i,0,N){
        if((msk & 1<<i) == 0){
            tot[msk | (1<<i)] = (tot[msk] + product[i])%MOD;
            dp[msk | (1<<i)] = min(dp[msk | (1<<i)], dp[msk] + max(product[i] - tot[msk], 0));
        }
    }

    cout << dp[(1<<N)-1] << endl;
    return 0;
}