#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int ans = 1000;
  int mi = a[0];
  int ma = a[0];
  for (int i = 0; i < n; i++) {
    if (ma < a[i]) {
      ma = a[i];
    } else {
      ans = ans + (ma - mi) * (ans / mi);
      mi = a[i];
      ma = a[i];
    }
  }
  ans = ans + (ma - mi) * (ans / mi);
  cout << ans << endl;
}
