#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;

int main() {
	int N; cin >> N;
	vector<int> M(N);
	for (int i = 0; i < N; i++)
		cin >> M[i];
	vector<int> dp(1<<N, INT_MAX / 2);
	dp[0] = 0;
	for (int S = 0; S < 1<<N; S++) {
		int sum = 0;
		for (int i = 0; i < N; i++)
			if (S>>i & 1)
				sum += M[i];
		for (int i = 0; i < N; i++)
			if (S>>i & 1);
			else {
				int _S = S + (1<<i);
				int x = max(0, M[i] - sum % 1000);
				dp[_S] = min(dp[_S], dp[S] + x);
			}
	}
	cout << dp[(1<<N) - 1] << endl;
}