#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0.0);
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class TT>
bool pal(T a, TT n) {
  int k = 0;
  for (int i = 0; i <= n / 2; i++) {
    if (a[i] != a[n - i - 1]) {
      k = 1;
      break;
    }
  }
  return k ? 0 : 1;
}
int main() {
  int n;
  cin >> n;
  vector<int> a(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int x = 1000, y = 0, cur = 1;
  for (int i = 2; i <= n; i++) {
    if (a[i] > a[i - 1]) {
      int mn = 1e9;
      for (int j = i - 1; j >= cur; j--) {
        mn = min(mn, a[j]);
      }
      int o = x / mn;
      x -= o * mn;
      y += o;
      x += o * a[i];
      y = 0;
      cur = i;
    }
  }
  cout << x;
  getchar();
  getchar();
  return 0;
}
