#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>


using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());



int niz[100];
int n;
ll dp[100][50005];


int main()
{

    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    ff(i,1,n)cin >> niz[i];
    dp[1][0] = 1000;

    ff(i,1,n){
        ff(j,0,10000)dp[i][j] = -1e9;
    }
    dp[1][0] = 1000;

    ff(i,1,n){
        ff(j,0,50000){
            if(dp[i][j] < 0)continue;
            dp[i + 1][0] = max(dp[i + 1][0], dp[i][j] + j*niz[i]);
            dp[i + 1][j + dp[i][j] / niz[i]] = max(dp[i + 1][j + dp[i][j] / niz[i]], dp[i][j]%niz[i]);
        }
    }
    int res = 0;
    cout << dp[n + 1][0] << "\n";
    return 0;
}
