#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC optimize("Os")
using namespace std;
using ll = long long int;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vi = vector<int>;
const ll mod = (ll)(1e9) + 7LL;
const ll M = 988244353LL;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ld pi = acos(-1);
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll P(ll B, ll power, ll modulo) {
  ll ans = 1LL;
  while (power > 0LL) {
    if (power % 2LL == 1LL) {
      ans = (ans * B) % modulo;
    }
    B = (B * B) % modulo;
    power /= 2LL;
  }
  return ans;
}
bool isPrime(ll n) {
  if (n <= 1LL) {
    return false;
  }
  if (n <= 3LL) {
    return true;
  }
  if (n % 2 == 0LL || n % 3 == 0LL) {
    return false;
  }
  for (ll i = 5LL; (i * i) <= n; i += 6LL) {
    if (n % i == 0LL || n % (i + 2LL) == 0LL) {
      return false;
    }
  }
  return true;
}
void vok() {
  ios_base::sync_with_stdio(false);
  cout.tie(NULL);
  cin.tie(NULL);
}
const int mxN = int(1e5) + 100;
void solve() {
  int n;
  cin >> n;
  vi price(n);
  for (auto &x : price) {
    cin >> x;
  };
  int i = 0;
  vi bs(n, -1);
  while (i < n - 1) {
    while ((i < n - 1) && (price[i + 1] <= price[i])) {
      i++;
    }
    if (i == n - 1) {
      break;
    }
    int buy = i++;
    while ((i < n) && (price[i] >= price[i - 1])) {
      i++;
    }
    int sell = i - 1;
    bs[buy] = 0;
    bs[sell] = 1;
  }
  int curr = 1000;
  int stocks = 0;
  for (int i = 0; i < n; i++) {
    if (bs[i] == 0) {
      int can = curr / price[i];
      curr -= (can * price[i]);
      stocks += can;
    } else if (bs[i] == 1) {
      curr += (stocks * price[i]);
      stocks = 0;
    }
  }
  curr = max(curr, 1000);
  cout << curr << "\n";
}
int main() {
  vok();
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
