#include <iostream>
#include <vector>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> ds(n);
    for (auto& d : ds) std::cin >> d;

    auto dp = vec(n + 1, vec(1 << n, 0));
    dp[0][0] = 100;

    int ans = 0;
    for (int k = 0; k <= n; ++k) {
        for (int b = 0; b < (1 << n); ++b) {
            if (dp[k][b] == 0) continue;

            for (int i = 0; i < n; ++i) {
                if ((b >> i) & 1) continue;

                auto nb = b | (1 << i);
                auto d = ds[i];

                if (d < 0) {
                    dp[k + 1][nb] = std::max(dp[k + 1][nb], dp[k][b] + d);
                } else {
                    dp[k][nb] = std::max(dp[k][nb], std::min((k + 1) * 100, dp[k][b] + d));
                }
            }
        }
        ans = std::max(ans, dp[k][(1 << n) - 1]);
    }

    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}