#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr long long inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll fact(long long i) {
  if (i == 0) return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
long long keta(ll n) {
  if (n == 0) return 1;
  long long count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) {
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
signed main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < (long long)(n); i++) cin >> a[i];
  long long flag = 2;
  vector<long long> ans(n, 0);
  for (long long i = 0; i < (long long)(n); i++) {
    if (i == n - 1) {
      if (a[i] > a[i - 1] && flag == 0) {
        ans[i] = 2;
      }
    } else if (a[i] < a[i + 1] && (flag == 2 || flag == 1)) {
      ans[i] = 1;
      flag = 0;
    } else if (a[i] > a[i + 1] && flag == 0) {
      ans[i] = 2;
      flag = 1;
    }
  }
  long long money = 1000;
  long long kub = 0;
  long long k = 0;
  for (long long i = 0; i < (long long)(n); i++) {
    if (ans[i] == 1) {
      kub += money / a[i];
      money %= a[i];
      flag = 2;
    } else if (ans[i] == 2) {
      money += kub * a[i];
      k++;
      flag = 1;
      kub = 0;
    }
  }
  cout << money << endl;
  return 0;
}
