#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64,i64> P;
#define rep(i,s,e) for(int i = (s);i <= (e);i++)

int n;
int m[20];

int dp[(1 << 15)];

int main()
{
    fill(dp , dp + (1 << 15),1e9);
    dp[0] = 0;
    cin >> n;
    rep(i,0,n - 1) cin >> m[i];

    rep(i,1,(1 << n) - 1)
    {
        rep(j,0,n - 1)
        {
            if(i & (1 << j))
            {
                //now , buy [j]
                int sub = i & ~(1 << j);
                int down = 0;
                rep(k,0,n - 1)
                {
                    if(sub & (1 << k))
                    {
                        down += m[k];
                    }
                }
                down %= 1000;
                int value = max(m[j] - down,0);
                dp[i] = min(dp[i] ,dp[sub] + value);
            }
        }
    }

    cout << dp[(1 << n) - 1] << endl;
}