// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

int msb(int x) {
  x = x & 0xFFFF0000 ? x & 0xFFFF0000 : x;
  x = x & 0xFF00FF00 ? x & 0xFF00FF00 : x;
  x = x & 0xF0F0F0F0 ? x & 0xF0F0F0F0 : x;
  x = x & 0xCCCCCCCC ? x & 0xCCCCCCCC : x;
  x = x & 0xAAAAAAAA ? x & 0xAAAAAAAA : x;
  return x;
}

int mgcd(int a, int b) {
  if(a > b) swap(a, b);
  if(a == 0) return b;
  ll a0 = a;
  while(msb(a) != msb(b)) a <<= 1;
  return mgcd(a ^ b, a0);
}

int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  int n;
  cin >> n;
  vector<ll> cnt(112345);
  ll sum = 0;
  ll g = 0;
  for(int i = 0; i < n; i++) {
    int a;
    cin >> a;
    cnt[a]++;
    g = mgcd(g, a);
    sum += a;
    if(cnt[a] == n) {
      cout << n << endl;
      return 0;
    }
  }
  
  ll ans = 1e18;
  for(ll t = 1; t < 1 << 20; t++) {
    ll i = 0;
    for(int k = 0; k < 20; k++) if(t & (1 << k)) {
      i ^= g << k;
    }
    ll res = sum;
    for(ll j = i; j <= 100000; j += i) {
      res -= cnt[j] * j;
      res += cnt[j] * j / i;
    }
    ans = min(ans, res);
  }

  cout << ans << endl;
  return 0;
}