#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const double PI = acos(-1);
const ll MOD = 1000000007;
using Graph = vector<vector<int>>;

int main() {
  int N; cin >> N;
  vector<ll> A(N);
  rep(i,N) cin >> A[i];

  set<ll> s;
  rep(i,N) {
    for (ll j = 1; j * j <= A[i]; j++) {
      if(A[i] % j == 0) {
        s.insert(j);
        s.insert(A[i] / j);
      }
    }
  }
  ll res = 1e18;
  for (auto i : s) {
    ll ans = 0;
    rep(j,N) {
      if (A[j] % i == 0) ans += (A[j] / i);
      else ans += A[j];
    }
    res = min(res,ans);
  }

  cout << res << endl;
}