#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template <class T>
inline bool chmax(T &a, const T &b) {
  if (b > a) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
constexpr int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
constexpr int INF = 1e9;
constexpr int MOD = 1e9 + 7;
constexpr long long LINF = 1e18;
constexpr double EPS = 1e-10;
constexpr double PI = M_PI;
void solve() {
  int N;
  cin >> N;
  vector<ll> a(N);
  for (int i = 0; i < N; ++i) cin >> a[i];
  ll res = 1000;
  int kabu = 0;
  if (a[0] < a[1]) {
    kabu += res / a[0];
    res %= a[0];
  }
  for (int i = 1; i < N - 1; ++i) {
    if (a[i - 1] <= a[i] && a[i] > a[i + 1]) {
      res += a[i] * kabu;
      kabu = 0;
    } else if (a[i] >= a[i] && a[i] < a[i + 1]) {
      kabu += res / a[i];
      res %= a[i];
    }
  }
  res += a[N - 1] * kabu;
  cout << res << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  solve();
  return 0;
}
