#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
int gcd(int a, int b) {
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool is_prime(long long N) {
  if (N == 1) return false;
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
vector<pair<long long, long long>> prime_factorize(long long n) {
  vector<pair<long long, long long>> res;
  for (long long p = 2; p * p <= n; ++p) {
    if (n % p != 0) continue;
    int num = 0;
    while (n % p == 0) {
      ++num;
      n /= p;
    }
    res.push_back(make_pair(p, num));
  }
  if (n != 1) res.push_back(make_pair(n, 1));
  return res;
}
int binary(int bina) {
  int ans = 0;
  for (int i = 0; bina > 0; i++) {
    ans = ans + (bina % 2) * pow(10, i);
    bina = bina / 2;
  }
  return ans;
}
int main() {
  int n;
  cin >> n;
  int a[n + 1];
  for (int i = (0); i < (n); ++i) {
    cin >> a[i];
  }
  int cnt = 0, sum = 1000;
  for (int i = (0); i < (n - 1); ++i) {
    cnt = 0;
    if (a[i] < a[i + 1]) {
      cnt = sum / a[i];
      sum -= a[i] * cnt;
      sum += a[i + 1] * cnt;
    }
    if (a[i] >= a[i + 1]) continue;
  }
  cout << sum << endl;
}
