#include <bits/stdc++.h>
using namespace std;
int n, m = 1000, p[100], cnt;
int ans;
inline int max(int a, int b) { return a > b ? a : b; }
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> p[i];
  p[0] = 100;
  ans = m;
  for (int i = 1; i <= n; i++) {
    if (p[i] <= p[i - 1] && p[i] < p[i + 1] && i < n) {
      cnt += ans / p[i];
      ans -= cnt * p[i];
    } else if (n > 1 && p[i] > p[i - 1] && p[i] >= p[i + 1]) {
      ans += cnt * p[i];
      cnt = 0;
    }
  }
  ans += cnt * p[n];
  printf("%d\n", ans);
  return 0;
}
