#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
long long GCD(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return GCD(b, a % b);
}
long long gcd(long long a, long long b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n + 1), ifact(n + 1) {
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
} comb(2000005);
mint g(int r, int c) { return comb(r + c + 2, r + 1) - 1; }
bool comp(int i, int j) { return i > j; }
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
  return a.second < b.second;
}
long tall[200000];
long long diff[200000];
vector<int> que;
bool isOK(int index, int key) {
  if (que[index] >= key)
    return true;
  else
    return false;
}
int binary_search(int key) {
  int left = -1;
  int right = (int)que.size();
  while (right - left > 1) {
    int mid = left + (right - left) / 2;
    if (isOK(mid, key))
      right = mid;
    else
      left = mid;
  }
  return right;
}
long long modpow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int main() {
  int n;
  vector<int> point;
  vector<pair<int, int>> pp;
  int plus = 0;
  bool wantPlus = false;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int tmp;
    cin >> tmp;
    point.push_back(tmp);
  }
  int buy = 0;
  for (int i = 1; i < n; i++) {
    int diff = point[i] - point[i - 1];
    if (wantPlus) {
      if (diff < 0) {
        wantPlus = false;
        pp.push_back(make_pair(buy, i - 1));
      }
    } else {
      if (diff > 0) {
        wantPlus = true;
        buy = i - 1;
      }
    }
  }
  if (wantPlus) {
    pp.push_back(make_pair(buy, n - 1));
  }
  int money = 1000;
  for (int i = 0; i < pp.size(); i++) {
    int buy = money / point[pp[i].first];
    money -= buy * point[pp[i].first];
    money += buy * point[pp[i].second];
  }
  cout << money;
}
