#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int n, m, t, k;
int d[((int)1e5 + 5)];
int countt[105];
int l = 1;
int r = 100;
void lbulma() {
  while (countt[l] == 0) l++;
  return;
}
void rbulma() {
  while (countt[r] == 0) r--;
  return;
}
int asal[4] = {2, 3, 5, 7};
int main() {
  long long int sum = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> d[i];
    sum += d[i];
    countt[d[i]]++;
  }
  lbulma();
  rbulma();
  long long minn = INT_MAX;
  for (int j = 100; j >= l; --j) {
    if (countt[j])
      for (int i = 10; i >= 2; --i) {
        if (j % i == 0 && (j / i) + (l * i) < j + l) {
          long long int tmp = sum - ((j + l) - ((j / i) + (l * i)));
          minn = min(minn, tmp);
        }
      }
  }
  cout << min(minn, sum) << endl;
}
