#include <bits/stdc++.h>
#define int int64_t
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define REPP(i, n) for (int i = 1; (i) < (int)(n+1); ++ (i))
#define REPR(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i=(m)-1; i>=(n); i--)
#define ALL(v) v.begin(), v.end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define SORTR(c) sort((c).begin(),(c).end(),greater<int>());
#define BIT(n) (1LL<<(n))
#define PCNT(x) __builtin_popcountll(x)
#define GCD(x,y) __gcd(x,y)
#define LCM(x,y) x/__gcd(x,y)*y
#define PB push_back
#define MP make_pair
#define endl "\n"
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
using namespace std;
using Graph = vector<vector<int> >;
using WeightedGraph = vector<vector<pair<int, int> > >;
typedef long double LD;
typedef vector<int> VI;
typedef vector<vector<int> > VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
const int INF = 2000000000;
const long double PI = acosl(-1);
const int MOD = 1000000007;
void print() {cout << endl;}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head; if (sizeof...(tail) != 0) cout << " ";print(forward<Tail>(tail)...);}
template <class T> void print(vector<T> &vec) {for (auto& a : vec) {cout << a; if (&a != &vec.back()) cout << " ";} cout << endl;}
template <class T> void print(vector<vector<T>> &df) { for (auto& vec : df) { print(vec);}}


signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << fixed << setprecision(10);
    int ans = 0;
    
    int N;
    cin >> N;
    vector<int> A(N);
    REP (i, N) {
        cin >> A[i];
    }

    int money = 1000;
    int now = 0;
    REP(i,N-1) {
        while (A[i] > A[i+1] && i < N-1) {
            i++;
        }
        now = money / A[i];
        money = money % A[i];
        while (A[i] < A[i+1] && i < N-1) {
            i++;
        }
        money += now * A[i];
        now = 0;
    }
    money += now * A[N-1];
    ans = max((int64_t)1000,money);
    cout << ans << endl;




    /*
    ans = 1000;
    int m = INF;
    int idm = 0;
    REP(i, N) {
        if (m > A[i]) {
            idm = i;
            m = A[i];
        }
    }
    int M = 0;
    int idM = 0;
    FOR(i,idm,N) {
        if (M < A[i]) {
            idM = i;
            M = A[i];
        }
    }
    ans = max(ans, 1000/m * M);

    M = 0;
    idM = 0;
    REP(i, N) {
        if (M < A[i]) {
            idM = i;
            M = A[i];
        }
    }
    m = INF;
    idm = 0;
    FOR(i,0,idM) {
        if (m > A[i]) {
            idm = i;
            m = A[i];
        }
    }
    ans = max(ans, 1000/m * M);
    cout << ans << endl;
    */
    
    
    return 0;
}

/*
cd ~/Desktop/Programming/AtCoder/contest/m-solutions2020/m_solutions2020_d && sh shellscripts/test_cpp.sh
cd ~/Desktop/Programming/AtCoder/contest/m-solutions2020/m_solutions2020_d && sh shellscripts/etest_cpp.sh
cd ~/Desktop/Programming/AtCoder/contest/m-solutions2020/m_solutions2020_d && sh shellscripts/submit_cpp.sh
*/


Measured memory_bytes: 3656