#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <limits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <array>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf 0x3f3f3f3f
#define uinf 0x3f3f3f3f3f3f3f3f
#define CLEAR(a) a = decltype(a)()
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define pii pair<int ,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define VVI vector<vector<int>>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define pi 2*acos(0.0)
#define INFILE() freopen("in.txt","r",stdin)
#define OUTFILE() freopen("out.txt","w",stdout)
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define FIN std::ifstream cin("D:\input.txt")

signed main(void) {
	int N; cin >> N;
	vector<int> M(N); for (auto &a : M) cin >> a;

	vector<int> dp((1 << N), inf);

	dp[0] = 0;

	for (int i = 0; i < (1 << N); ++i) {
		for (int j = 0; j < N ; ++j) if((i>>j)&1) {
			int sub = i & ~(1 << j);
			int ssum = 0; REP(k, N) if ((i >> k) & 1) ssum += M[k];
			ssum -= M[j];
			dp[i] = min(dp[i], dp[sub] + max(M[j] - (ssum%1000), 0));
		}
	}

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