#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; constexpr int INF = 1001001001; constexpr int mod = 1000000007; // constexpr int mod = 998244353; template inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template inline bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } struct ExtendedSieve{ vector table; const int n; ExtendedSieve(int n) : n(n) { table.assign(n + 1, 0); table[0] = table[1] = 1; for(int i = 2; i <= n; ++i){ if(table[i] > 0) continue; table[i] = i; for(int j = i + i; j <= n; j += i){ if(table[j] == 0) table[j] = i; } } } int operator[](const int& k){ return table[k]; } bool is_prime(int x){ if(x < 2) return false; return x == table[x]; } map prime_factorization(int x){ map res; while(x > 1){ ++res[table[x]]; x /= table[x]; } return res; } }; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int N; cin >> N; vector M(N); for(int i = 0; i < N; ++i) cin >> M[i]; vector dp(1 << N, INF); dp[0] = 0; for(int mask = 0; mask < (1 << N) - 1; ++mask){ int discount = 0; for(int i = 0; i < N; ++i){ if(mask >> i & 1) discount += M[i]; } discount %= 1000; for(int i = 0; i < N; ++i){ if(mask >> i & 1) continue; chmin(dp[mask | (1 << i)], dp[mask] + max(0, M[i] - discount)); } } cout << dp[(1 << N) - 1] << endl; return 0; }