#include using namespace std; using lint = long long int; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define POW2(n) (1LL << (n)) #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector &vec, int len) { vec.resize(len); } template void ndarray(vector &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template pair operator+(const pair &l, const pair &r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair &l, const pair &r) { return make_pair(l.first - r.first, l.second - r.second); } template istream &operator>>(istream &is, vector &vec){ for (auto &v : vec) is >> v; return is; } ///// This part below is only for debug, not used ///// template ostream &operator<<(ostream &os, const vector &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const deque &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const set &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_set &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const multiset &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_multiset &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const pair &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template ostream &operator<<(ostream &os, const map &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_map &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; ///// END ///// /* #include #include #include using namespace __gnu_pbds; // find_by_order(), order_of_key() template using pbds_set = tree, rb_tree_tag, tree_order_statistics_node_update>; template using pbds_map = tree, rb_tree_tag, tree_order_statistics_node_update>; */ constexpr int D = 18; vector makePrimeLst(int N) { vector ans; vector alive(N+1, 1); lint now = 2; for (; now * now <= N; now++) { if (alive[now]) ans.push_back(now); for (int t = now; t <= N; t += now) alive[t] = 0; } for (; now <= N; now++) if (alive[now]) ans.push_back(now); return ans; } // 素因数分解 map primeFactorize(lint N, const vector &primeLst) { map ans; for (auto v : primeLst) { while (!(N % v)) { N /= v; ans[v]++; } if (N == 1) return ans; } ans[N]++; return ans; // exit(1); } // 約数 unsorted vector divisor(lint n, const vector &primeLst) { map factor = primeFactorize(n, primeLst); vector now{1}, nxt; for (auto pa : factor) { nxt.clear(); for (auto v : now) { REP(i, pa.second + 1) { nxt.push_back(v); v *= pa.first; } } swap(now, nxt); } return now; } int main() { vector primes = makePrimeLst(1000); int N; cin >> N; vector A(N); cin >> A; vector V(1 << D); for (auto x : A) { while (x < 1 << D) { V[x] = 1; x *= 2; } } int t = 0; IREP(i, 1 << D) { if (V[i]) { V[i ^ t] = 1; t = i; } } vector cou(100010); for (auto x : A) { vector y = divisor(x, primes); for (auto i : y) cou[i] += x; } lint tot = accumulate(ALL(A), 0LL); lint ret = tot; FOR(i, 1, 100001) if (V[i]) { mmin(ret, tot - cou[i] + cou[i] / i); } cout << ret << endl; }