#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
long long modpow(long long a, long long n, long long mod) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
vector<int> vect_yakusuu(int n) {
  vector<int> ret;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret));
  return ret;
}
int main() {
  int N, A[100];
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  int bankroll = 1000;
  for (int i = 0; i < N - 1; i++) {
    if (A[i] < A[i + 1]) {
      bankroll += (bankroll / A[i]) * (A[i + 1] - A[i]);
    }
  }
  cout << bankroll << endl;
  return 0;
}
