#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int (i)=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RANGE(vec) (vec).begin(),(vec).end()

using namespace std;


class Monster {
public:
    void solve(void) {
            int N;
            cin>>N;
            vector<int> D(N);
            REP(i,N)
                cin>>D[i];
            sort(RANGE(D));

            int res = 0;
            do {
                int HP = 100;
                int maxHP = 100;
                REP(i,N)
                {
                    if (D[i] > 0)
                        HP = min(maxHP, HP+D[i]);
                    else
                    {
                        HP += D[i];
                        maxHP += 100;
                    }
                    if (HP <= 0)
                        break;
                }
                res = max(res, HP);
            } while (next_permutation(RANGE(D)));

            cout<<res<<endl;
    }
};

#if 1
int main(int argc, char *argv[])
{
        ios::sync_with_stdio(false);
        auto obj = new Monster();
        obj->solve();
        delete obj;
        return 0;
}
#endif