#include <bits/stdc++.h>

using namespace std;

int dp[1<<15];

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

	int n,t;
	vector <int> v;

	cin >> n;
	for(int i=0;i<n;i++)
	{
		cin >> t;
		v.push_back(t);
	}	
	for(int i=0;i<(1<<n);i++)
	{
		dp[i] = 1e9;
	}
	dp[0] = 0;
	for(int i=0;i<(1<<n);i++)
	{
		int sum = 0;
		for(int j=0;j<n;j++)
		{
			if((i&(1<<j)))
			{
				sum += v[j];
			}
		}
		for(int j=0;j<n;j++)
		{
			if((i&(1<<j))==0)
			{
				int cost = v[j] - (sum%1000);
				if(cost < 0)
				{
					cost = 0;
				}
				dp[i + (1<<j)] = min(dp[i + (1<<j)],dp[i] + cost);
			}
		}
	}

	cout << dp[(1<<n)-1] << '\n';

    return 0;
}