#include <bits/stdc++.h>
auto clk = clock();
const long double PI2 = acos(-1) / 2.0l;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0},
          dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long MAXN = 100010;
long long Gcd(long long a, long long b) {
  if (a % b == 0) return b;
  return Gcd(b, a % b);
}
long long Max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
long long Min(long long a, long long b) {
  if (a < b) return a;
  return b;
}
void kickstartFormat() {
  static int tno = 1;
  cout << "Case #" << tno++ << ": ";
}
void printvector(std::vector<long long> v) {
  for (int i = 0; i < v.size(); ++i) {
    cout << v[i] << " ";
  }
  cout << "" << endl;
}
void printarray(long long a[], long long n) {
  for (long long i = 0; i < n; ++i) {
    cout << a[i] << " ";
  }
  cout << "" << endl;
}
long long findlcm(vector<long long> arr, long long n) {
  long long ans = arr[0];
  for (int i = 1; i < n; i++) ans = (((arr[i] * ans)) / (Gcd(arr[i], ans)));
  return ans;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long lowerbound(long long k, vector<long long> v) {
  long long l = 0;
  long long size = v.size();
  long long r = size - 1;
  long long mid;
  while (l <= r) {
    mid = (l + r) / 2;
    if (v[mid] < k)
      l = mid + 1;
    else {
      r = mid - 1;
    }
  }
  return l;
}
long long upperbound(long long k, vector<long long> v) {
  long long l = 0;
  long long size = v.size();
  long long r = size - 1;
  long long mid;
  while (l <= r) {
    mid = (l + r) / 2;
    if (v[mid] > k)
      r = mid - 1;
    else {
      l = mid + 1;
    }
  }
  return l;
}
long long spf[MAXN];
void sieve() {
  spf[1] = 1;
  for (int i = 2; i < MAXN; i++) spf[i] = i;
  for (int i = 4; i < MAXN; i += 2) spf[i] = 2;
  for (int i = 3; i * i < MAXN; i++) {
    if (spf[i] == i) {
      for (int j = i * i; j < MAXN; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
long long n, m;
vector<long long> shortPath(vector<pair<long long, long long>> v[],
                            long long src, long long V = 0) {
  set<pair<long long, long long>> setds;
  long long sizee = V;
  long long IN = 1000000000000000000;
  vector<long long> dist(sizee, IN);
  vector<bool> vis(sizee, false);
  setds.insert(make_pair(0, src));
  dist[src] = 0;
  while (!setds.empty()) {
    pair<long long, long long> tmp = *(setds.begin());
    setds.erase(setds.begin());
    long long u = tmp.second;
    if (vis[u]) continue;
    vis[u] = true;
    vector<pair<long long, long long>>::iterator i;
    for (auto i = v[u].begin(); i != v[u].end(); ++i) {
      long long v = (*i).first;
      long long weight = (*i).second;
      if (dist[v] > dist[u] + weight) {
        if (dist[v] != 1000000000000000000)
          setds.erase(setds.find(make_pair(dist[v], v)));
        dist[v] = dist[u] + weight;
        setds.insert(make_pair(dist[v], v));
      }
    }
  }
  return dist;
}
long long root(long long a[], long long r) {
  if (a[r] == r) {
    return r;
  } else {
    long long x = root(a, a[r]);
    a[r] = x;
    return x;
  }
}
void unio(long long a[], long long size[], long long x, long long y) {
  x = root(a, x);
  y = root(a, y);
  if (x == y) {
    return;
  }
  if (size[x] >= size[y]) {
    a[y] = x;
    size[x] += size[y];
  } else {
    a[x] = y;
    size[y] += size[x];
  }
}
struct as {
  long long a;
  long long b;
  long long c;
};
vector<long long> ar(82);
map<pair<pair<long long, long long>, long long>, long long> ma;
long long f(long long in, long long st, long long cash) {
  if (ma.count({{in, st}, cash})) {
    return ma[{{in, st}, cash}];
  }
  if (in >= n) {
    return cash;
  }
  long long sto = cash / ar[in];
  long long change;
  change = cash % ar[in];
  long long casho = st * ar[in];
  if (in == n - 1) {
    return ma[{{in, st}, cash}] =
               max(f(in + 1, st, cash),
                   max(f(in + 1, sto, change), f(in + 1, 0, casho + cash)));
  }
  return ma[{{in, st}, cash}] =
             max(f(in + 1, st, cash),
                 max(f(in + 1, sto, change), f(in + 1, 0, casho + cash)));
  if (cash == -1) {
    long long cs = st * ar[in];
    if (in == n - 1) {
      return ma[{{in, st}, cash}] = cs;
    }
    long long oi = in;
    return ma[{{in, st}, cash}] = max(f(in + 1, -1, cs), f(in + 1, st, -1));
  }
  if (st == -1) {
    if (in >= n) {
      return ma[{{in, st}, cash}] = cash;
    }
    long long sto = cash / ar[in];
    long long change = cash % ar[in];
    long long oi = in;
    if (in == n - 1) {
      return ma[{{in, st}, cash}] = cash;
    }
    return ma[{{in, st}, cash}] = max(f(in + 1, -1, cash), f(in + 1, sto, -1));
  }
}
void CV(long long txt) {
  cin >> n;
  for (int i = (0), _b = (n - 1); i <= _b; i++) {
    cin >> ar[i];
  }
  long long mx = -1;
  vector<long long> mxx(n);
  for (int i = n - 1; i >= 0; i--) {
    mxx[i] = max(mx, ar[i]);
    mx = max(mx, ar[i]);
  }
  cout << (max(f(1, 1000 / ar[0], 1000 % ar[0]), f(1, 0, 1000))) << endl;
  return;
  vector<long long> prof(n + 4, 0);
  long long mxp = 1000;
  for (int i = n - 1; i >= 0; i--) {
    long long st = 1;
    long long mxa = 0;
    for (long long j = i + 1; j < n; j++) {
      if (ar[j] > ar[i]) {
        long long po = (ar[j] - ar[i]) * st;
        po += prof[j + 1];
        mxa = max(mxa, po);
      }
    }
    prof[i] = max(prof[i + 1], mxa);
    st = 1000 / ar[i];
    mxp = max((st * prof[i]), mxp);
  }
  {
    cout << mxp << endl;
    cerr << endl;
    return;
  };
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long x68 = 1;
  for (long long vi = 1; vi <= x68; vi++) {
    CV(vi);
  }
  return 0;
}
