#include using namespace std; #define ll long long #define vvi vector> #define vec vector #define pq priority_queue #define all(v) (v).begin(), (v).end() #define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end()); #define rep(i, n) for (int (i) = (0); (i) < (n); ++(i)) #define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i)) #define dbg(x) cerr << #x << ": " << x << endl; #define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<(value) << endl; #define line() cerr << "---------------" << endl; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const double PI = 3.14159265358979323846; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b void printA(vector &printArray, char between = ' ') { int paSize = printArray.size(); for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;} if (between != '\n') {cerr << endl;} } // ------------------------------------------------------------------------------------------ const int INF = 1e8; int N; int M[11111]; int dp[11111]; bool used[11111]; int ans = 1e8; int dfs(int listPriceSum) { if (count(used, used+N, true)==N) { return 0; } int res = 0; int tmp = INF; rep (i, N) { if (used[i]) continue; used[i] = true; int discount = listPriceSum % 1000; int price = max(0, M[i] - discount); tmp = min(tmp, dfs(listPriceSum+M[i])+price); used[i] = false; } return res+tmp; } int main() { cin >> N; rep (i, N) { cin >> M[i]; } fill(dp, dp+N, INF); cout << dfs(0) << endl; return 0; }