#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using G = vector<vector<int>>;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < (n); ++i) cin >> a[i];
  int money = 1000;
  int kabu = 0;
  vector<int> kyoku(n);
  for (int i = 0; i < (n - 1); ++i) {
    if (a[i] < a[i + 1])
      kyoku[i] = -1;
    else if (a[i] > a[i + 1])
      kyoku[i] = 1;
  }
  for (int i = 0; i < (n - 1); ++i) {
    if (kyoku[i] == -1) {
      kabu += money / a[i];
      money %= a[i];
    } else if (kyoku[i] == 1) {
      money += kabu * a[i];
      kabu = 0;
    }
  }
  money += kabu * a[n - 1];
  cout << money << endl;
  return 0;
}
