#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int clz(int x) { int ret = 0; rrep(i, 30) { if (1 & (x >> i))break; ret++; } return ret; } int gcd(int x, int y) { if (x < y)swap(x, y); if (0 == y)return x; int z = y; while (clz(x) != clz(z)) z <<= 1; return gcd(y, x^z); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; long long sum = 0; vectorcnt(100005); vectora(n); int g = 0; rep(i, n) { cin >> a[i]; g = gcd(g, a[i]); cnt[a[i]]++; sum += a[i]; } vectormemo(100001); long long ans = LINF; rep2(i, 1, 100001) { memo[i] = sum; for (int j = i; j < 100001; j += i) { memo[i] -= 1LL * cnt[j] * j; memo[i] += 1LL * cnt[j] * (j / i); } if (0 == i % g)chmin(ans, memo[i]); } cout << ans << endl; return 0; }