#include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
const int INF = 1e9 + 7;
const ll INFL = 9 * 1e18;
const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
ll inline digit(ll num) {
  int tmp = 0;
  while (num) {
    tmp++;
    num /= 10;
  }
  return tmp;
}
template <typename T>
inline void print(T&& x) {
  cout << x << endl;
}
template <typename T>
inline T SUM(vector<T> vec) {
  return accumulate((vec).begin(), (vec).end(), (T)0);
}
template <typename T>
inline T digitSum(T num) {
  T sum = 0;
  while (num) {
    sum += num % 10;
    num /= 10;
  }
  return sum;
}
template <typename T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <typename T>
inline T lcm(T a, T b) {
  T g = gcd(a, b);
  return a / g * b;
}
template <typename T>
inline T power(T a, T b) {
  T tmp = 1;
  for (int i = 0; (i) < ((int)(b)); ++(i)) {
    tmp *= a;
  }
  return tmp;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int ctoi(char c) { return c - '0'; }
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; (i) < ((int)(n)); ++(i)) cin >> a[i];
  int kabu = 0;
  int price = INF;
  int money = 1000;
  for (int i = 0; (i) < ((int)(n)); ++(i)) {
    if (a[i] > price) {
      money -= kabu * price;
      money += a[i] * kabu;
    }
    kabu = money / a[i];
    price = a[i];
  }
  print(money);
  return 0;
}
