//2020年4月17日現在

#include<stdio.h>
#include<cmath>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<complex>
#include<queue>
#include<set>
#include<utility>
#include<iomanip>
#include<limits>
#include<thread>
#include<map>
#include<stack>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<tuple>
#include <cstdio>

using namespace std;

template <class... A>
void prints() { cout << "\n"; }
template <class... A>
void prints_rest() { cout << "\n"; }
template <class T, class... A>
void prints_rest(const T &first, const A &... rest) { cout << " " << first; prints_rest(rest...); }
template <class T, class... A>
void prints(const T &first, const A &... rest) { cout << first; prints_rest(rest...); }
template <class T, class... A>
void printd(const T &first, const A &... rest) { cout << fixed << setprecision(15) << first; prints_rest(rest...); }


namespace {
	// printElems(&a[0], &a[n]);　みたいな感じで使う。
	void printElems(const int* begin, const int* end)
	{
		for (const int* p = begin; p != end; ++p) {
			cout << *p << ' ';
		}
		cout << endl;
	}
}

#define rep(i,n) for(ll i=0; i<n; i++)
#define rep1(i,n) for(ll i=1; i<n+1; i++)
#define repr(i,n) for(ll i=n-1; i>=0; i--)
#define repr1(i,n) for(ll i=n; i>0; i--)
#define FOR(i,j,n) for(ll i=j; i < n; i++)
#define souatari(i,j,n) rep1(i,n-1)rep(j,i)
#define souatari1(i,j,n) for(ll i=2; i<n+1; i++)rep1(j,i-1)
#define mp make_pair
#define F first
#define S second
#define elif else if

typedef long long ll;
typedef vector<int>  vi;
typedef vector<vi>  vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef array<int,3> arr3;
typedef long double D;


const ll llinf =  numeric_limits<ll>::max();
const ll _llinf = numeric_limits<ll>::lowest();
const int inf = numeric_limits<int>::max();
const int _inf = numeric_limits<int>::lowest();
const double dinf = numeric_limits<double>::infinity();
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const ll BIG = 1LL<<60;
const string yes = "Yes";
const string no = "No";

//----------------------------------------------

ll a[100];
map<ll,ll> m[100];

int main(){
	int n;
	cin >> n;
	rep(i,n)cin >> a[i+1];
	m[0].insert(mp(0,1000));
	rep1(i,n){

		for(auto it = m[i-1].begin(); it != m[i-1].end(); ++it) {
			ll kabu = it->F;
			ll money = it->S;
//			prints(i,kabu,money);
			auto itr = m[i].find(kabu);        // "xyz" が設定されているか？
			if( itr != m[i].end() ) {
				m[i][kabu] = max(m[i][kabu],money);
			} else {
				m[i].insert(mp(kabu,money));
			}
			itr = m[i].find(0);        // "xyz" が設定されているか？
			if( itr != m[i].end() ) {
				m[i][0] = max(m[i][0],money+kabu*a[i]);
			} else {
				m[i].insert(mp(0,money+kabu*a[i]));
			}
			itr = m[i].find(kabu+money/a[i]);
//			prints("check point");       // "xyz" が設定されているか？
			if( itr != m[i].end() ) {
				m[i][kabu+money/a[i]] = max(m[i][kabu+money/a[i]],money%a[i]);
			} else {
				m[i].insert(mp(kabu+money/a[i],money%a[i]));
			}

        //std::cout << "key = " << itr->first           // キーを表示
        //                << ", val = " << itr->second << "\n";    // 値を表示
		}
	}
//	prints("check point");
	ll ans = 0;
	for(auto itr = m[n].begin(); itr != m[n].end(); ++itr) {
		ans = max(ans,itr->S);
	}
	prints(ans);

	return 0;
}




Measured memory_bytes: 3728