#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int(i) = 0; (i) < (n); (i)++) cin >> a[i];
  int money = 1000;
  int stock = 0;
  for (int i = 0; i < n - 1; i++) {
    if (a[i] < a[i + 1]) {
      stock = money / a[i];
      money = money % a[i];
      money += stock * a[i + 1];
      stock = 0;
    } else
      continue;
  }
  cout << money;
}
int main() {
  int T;
  T = 1;
  while (T--) {
    solve();
    cout << endl;
  }
}
