//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>


using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x*x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
#define loop(n) FOR(i,0,n)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

int main() {
	int n; cin >> n;

	vector<int> price(n);
	for (int i = 0; i < n; i++) {
		cin >> price[i];
	}

	//dp[購入済みの商品を表す部分集合]の状態の時の最小値
	vector<int> dp((1<<n), INF);

	//何もかってなければ購入代金は0円
	dp[0] = 0;

	//部分集合ｓについて全探索
	for (int s = 0; s <(1<<n); s++) {

		//sに含まれていない商品をとってくる
		for (int k = 0; k < n; k++) {
			if ((s >> k) & 1)continue;
			
			int sum = 0;
			
			//ｓの商品の定価を計算
			for (int i = 0; i < n; i++) {
				if ((s >> i) % 2 == 0)continue;
				sum += price[i];
			}

			//値引き額は定価のmod1000,ただしマイナスにはならない
			int discount = sum % 1000;
			int p = max(price[k] - discount, 0);

			int nexts = s | (1 << k);

			dp[nexts] = min(dp[nexts], dp[s]+p);

		}
	}

	int all = (1 << n) - 1;

	cout << dp[all] << endl;

	return 0;
}