#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<long long>>;
using Real = long double;
using Point = complex<Real>;
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;
template <typename T>
long long getIndexOfLowerBound(vector<T> &v, T x) {
  return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T>
long long getIndexOfUpperBound(vector<T> &v, T x) {
  return upper_bound(v.begin(), v.end(), x) - v.begin();
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
istream &operator>>(istream &is, Point &p) {
  Real a, b;
  is >> a >> b;
  p = Point(a, b);
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
  is >> p_var.first >> p_var.second;
  return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  cerr << '{';
  os << pair_var.first;
  cerr << ',';
  os << " " << pair_var.second;
  cerr << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
  cerr << '[';
  for (long long i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  cerr << ']';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
  for (auto &vec : df) os << vec;
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
  cerr << "{";
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) cerr << ", ";
    itr--;
  }
  cerr << "}";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
  cerr << "{";
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) cerr << ", ";
    itr--;
  }
  cerr << "}";
  return os;
}
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head;
  if (sizeof...(tail) != 0) cout << " ";
  print(forward<Tail>(tail)...);
}
void dump_func() { cerr << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  cerr << head;
  if (sizeof...(Tail) > 0) cerr << ", ";
  dump_func(std::move(tail)...);
}
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  vector<long long> a(n);
  cin >> a;
  vector<long long> q;
  long long t = 0;
  for (long long(i) = 0; (i) < (n - 1); (i)++) {
    if (t == 0) {
      if (a[i] < a[i + 1]) {
        q.push_back(a[i]);
        t = 1 - t;
      }
    } else {
      if (a[i] > a[i + 1]) {
        q.push_back(a[i]);
        t = 1 - t;
      }
    }
  }
  if (q[q.size() - 1] < a[n - 1]) q.push_back(a[n - 1]);
  long long now = 1000, stack = 0;
  for (long long(i) = 0; (i) < (q.size() - 1); (i)++) {
    if (q[i] < q[i + 1]) {
      stack = now / q[i];
      now %= q[i];
      now += q[i + 1] * stack;
      stack = 0;
    }
  }
  print(now);
}
