/* Priyansh Agarwal*/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<algorithm>
#include<unordered_map>
#include<vector>
#include<unordered_set>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<map>
#include<chrono>
using namespace std;
using namespace __gnu_pbds;
using namespace chrono;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define nline "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define debug(x) cout << #x << " " << x <<endl;
#define set_bits __builtin_popcount
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update > pbds;
/*---------------------------------------------------------------------------------------------------------------------------*/
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll expo(ll a, ll b, ll mod) {ll res = 1; while (b > 0) {if (b & 1)res = (res * a) % mod; a = (a * a) % mod; b = b >> 1;} return res;}
void extendgcd(ll a, ll b, ll*v) {if (b == 0) {v[0] = 1; v[1] = 0; v[2] = a; return ;} extendgcd(b, a % b, v); ll x = v[1]; v[1] = v[0] - v[1] * (a / b); v[0] = x; return;} //pass an arry of size 3
ll mminv(ll a, ll b) {ll arr[3]; extendgcd(a, b, arr); return arr[0];} //for non prime b
ll mminvprime(ll a, ll b) {return expo(a, b - 2, b);}
bool revsort(ll a, ll b) {return a > b;}
void swap(int &x, int &y) {int temp = x; x = y; y = temp;}
ll combination(ll n, ll r, ll m, ll* fact) {ll val1 = fact[n]; ll val2 = mminvprime(fact[r], m); ll val3 = mminvprime(fact[n - r], m); return ((val1 * val2) % m * val3) % m;}
void google(int t) {cout << "Case #" << t << ": ";}
vector<int> sieve(int n) {int*arr = new int[n + 1](); vector<int> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}
/*--------------------------------------------------------------------------------------------------------------------------*/
ll helper(int start, int money, int stocks, int n, ll *arr, ll ***dp)
{
	if (start == n)
	{
		return money;
	}
	if (dp[start][stocks][money] != -1)
		return dp[start][stocks][money];
	ll ans1 = helper(start + 1, money, stocks, n, arr, dp);
	int money1 = money;
	int stocks1 = stocks;
	while (stocks > 0)
	{
		money += arr[start];
		stocks -= 1;
		ans1 = max(ans1, helper(start + 1, money, stocks, n, arr, dp));
	}
	money = money1;
	stocks = stocks1;
	while (money >= arr[start])
	{
		money -= arr[start];
		stocks += 1;
		ans1 = max(ans1, helper(start + 1, money, stocks, n, arr, dp));
	}
	dp[start][stocks1][money1] = ans1;
	return ans1;
}
void solve()
{
	int t;
	// cin >> t;
	int total = 0;
	t = 1;
	while (t--)
	{
		int n;
		cin >> n;
		ll *arr = new ll[n];
		for (int i = 0; i < n; i++)
			cin >> arr[i];
		ll ***dp = new ll**[n + 1];
		for (int i = 0; i <= n; i++)
		{
			dp[i] = new ll*[2000];
			for (int j = 0; j < 2000; j++)
			{
				dp[i][j] = new ll[5000];
				for (int k = 0; k < 5000; k++)
					dp[i][j][k] = -1;
			}
		}
		cout << helper(0, 1000, 0, n, arr, dp) << endl;
	}
}
int main()
{
	fastio();
#ifndef ONLINE_JUDGE
	freopen("Input.txt", "r", stdin);
	freopen("Output.txt", "w", stdout);
	freopen("Error.txt", "w", stderr);
#endif
	auto start1 = high_resolution_clock::now();
	solve();
	auto stop1 = high_resolution_clock::now();
	auto duration = duration_cast<microseconds>(stop1 - start1);
#ifndef ONLINE_JUDGE
	cerr << "Time: " << duration.count() / 1000.0 << endl;
#endif
	return 0;
}