#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n, m[15];
int dp[1<<15];

int main() {
	cin >> n;
	REP(i, n) scanf("%d", m + i);
	
	fill(dp, dp + (1<<n), INF);
	dp[0] = 0;
	
	REP(s, 1<<n) {
		int sum = 0;
		REP(i, n) if (s >> i & 1) sum += m[i];
		
		int d = sum % 1000;
		
		REP(i, n) if (!(s >> i & 1)) {
			if (m[i] >= d) chmin(dp[s | 1<<i], dp[s] + m[i] - d);
			else chmin(dp[s | 1<<i], dp[s]);
		}
	}
	
	cout << dp[(1<<n) - 1] << endl;
	
	return 0;
}