#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 7;
const long long INF = LONG_LONG_MAX;
void solve() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < (n); i++) cin >> a[i];
  int ud[n];
  ud[0] = 0;
  for (int i = 1; i < (n); i++) {
    if (a[i - 1] <= a[i])
      ud[i] = 1;
    else
      ud[i] = 0;
  }
  bool ok = 0;
  int take, cnt = 1000;
  for (int i = 1; i < (n); i++) {
    if (ud[i] == 1) cnt += (a[i] - a[i - 1]) * (cnt / a[i - 1]);
  }
  cout << cnt;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  cerr << "[ Time : " << (float)clock() / CLOCKS_PER_SEC << " secs ]" << endl;
}
