#include <iostream>
#define INF 1000000000

using namespace std;


/*---------------------------------------------------*/

bool contain(int mask, int pos){
    return (mask & (1 << pos)) != 0; 
}

int main(){
    int n, m[17], dp[1 << 16];
    cin >> n;
    for(int i = 0;i < n; i++){
        cin >> m[i];
    }
    for(int i = 0; i < (1 << 16); i++)dp[i] = INF;

    dp[0] = 0;
    for(int mask =1; mask < (1 << n); mask++){
        for(int i = 0; i < n;  i++){
            if(contain(mask, i)){
                int sum = 0;
                for(int j = 0; j < n; j++){
                    if(contain(mask, j) && j != i){
                        sum += m[j];
                    }
                }
                dp[mask] = min(dp[mask], dp[mask^(1<<i)] + max(0, m[i] - (sum % 1000)));
            }
        }
    }
    cout<<dp[(1 << n) - 1]<<endl;
    return 0;
}