#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;
int dp[90][2001][21];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, j, k, temp;
  cin >> n;
  int a[n];
  for (i = 0; i <= n - 1; i++) cin >> a[i];
  memset(dp, 0, sizeof(dp));
  dp[0][1000][0] = 1;
  for (i = 0; i <= n - 1; i++) {
    for (j = 0; j <= 2000; j++) {
      for (k = 0; k <= 20; k++) {
        if (!dp[i][j][k]) continue;
        dp[i + 1][j][k] = 1;
        dp[i + 1][j % a[i]][k + j / a[i]] = 1;
        dp[i + 1][j + a[i] * k][0] = 1;
      }
    }
  }
  int ans = 0;
  for (i = 0; i <= 2000; i++)
    if (dp[n][i][0]) ans = i;
  cout << ans;
  return 0;
}
