#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
vector<char*> tokenizer(const char* args) {
  char* token = new char[111];
  strcpy(token, args);
  token = strtok(token, ", ");
  vector<char*> v({token});
  while (token = strtok(NULL, ", ")) v.push_back(token);
  return reverse(v.begin(), v.end()), v;
}
void debugg(vector<char*> args) { cerr << "\b\b "; }
template <typename Head, typename... Tail>
void debugg(vector<char*> args, Head H, Tail... T) {
  debug() << " [" << args.back() << ": " << H << "] ";
  args.pop_back();
  debugg(args, T...);
}
long long mod = 1e9 + 7;
const int MX = 0x3f3f3f3f;
long long dp[90][1001];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, j, k;
  long long temp;
  cin >> n;
  int a[n];
  for (i = 0; i <= n - 1; i++) cin >> a[i];
  memset(dp, -1, sizeof(dp));
  dp[0][0] = 1000;
  for (i = 0; i <= n - 1; i++) {
    for (k = 0; k <= 1000; k++) {
      if (dp[i][k] == -1) continue;
      {};
      temp = dp[i][k];
      dp[i + 1][k] = max(dp[i + 1][k], temp);
      dp[i + 1][k + temp / a[i]] = max(temp % a[i], dp[i + 1][k + temp / a[i]]);
      dp[i + 1][0] = max(temp + a[i] * k, dp[i + 1][0]);
    }
  }
  cout << dp[n][0];
  return 0;
}
