#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define hii cout << "hii" << endl
#define int long long
#define endl '\n'
#define all(s) s.begin(), s.end()
 
template <class T> ostream& operator << (ostream &os, const vector<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T> ostream& operator << (ostream &os, const set<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const pair<T, S> &v) { os << v.first << ' ' << v.second; return os; }
template <class T, class S> ostream& operator << (ostream &os, const unordered_map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; }
 
 
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <class Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 << endl; }
    template <class Arg1, class... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args) {
        const char* sep = strchr(names + 1, ',');
        cerr.write(names, sep - names) << " : " << arg1 << "  ";
        __f(sep + 1, args...);
    }
#else
#define trace(...) 0
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE

const int N = 3e5 + 5;
const int MAX = 250000 + 5;
const int M = 5e6 + 5;
const int mod = 998244353;
const int MOD = 998244353;
const int INF = 1e15;
const int LG = 21;


int arr[N];
int DP[80][20000][40];
int n;

int f(int idx, int cost, int left)
{
	if(cost < 0) return -INF;
	if(left < 0) return -INF;
	if(idx == n)
	{
		if(left == 0)
		{
			return 0;
		}
		else
		{
			return -INF;
		}
	}
	int & ret = DP[idx][cost][left];
	if(~ret) return ret;
	int ans = -INF;
	for(int i = 0;; i++)
	{
		if(i * arr[idx] > cost)
		{
			break;
		}
		ans = max(ans, -i * arr[idx] + f(idx + 1, cost - i * arr[idx], left + i));
	}
	for(int k = 0; k <= left; k++)
	{
		ans = max(ans, k * arr[idx] + f(idx + 1, cost + k * arr[idx], left - k));
	}
	return ret = ans;
}

void solve()
{
	memset(DP, -1, sizeof(DP));
	cin >> n;
	for(int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	cout << 1000 + f(0, 1000, 0) << endl;
}
 
int32_t main() 
{	
	ios_base:: sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	    int t = 1;
	    // cin >> t;
	while(t--)solve();
	return 0;
}