#pragma region kyopro_template #include #define pb push_back #define eb emplace_back #define fi first #define se second #define each(x, v) for (auto &x : v) #define all(v) (v).begin(), (v).end() #define sz(v) ((int)(v).size()) #define mem(a, val) memset(a, val, sizeof(a)) #define ini(...) \ int __VA_ARGS__; \ in(__VA_ARGS__) #define inl(...) \ long long __VA_ARGS__; \ in(__VA_ARGS__) #define ins(...) \ string __VA_ARGS__; \ in(__VA_ARGS__) #define inc(...) \ char __VA_ARGS__; \ in(__VA_ARGS__) #define in2(s, t) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i]); \ } #define in3(s, t, u) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i]); \ } #define in4(s, t, u, v) \ for (int i = 0; i < (int)s.size(); i++) { \ in(s[i], t[i], u[i], v[i]); \ } #define rep(i, N) for (long long i = 0; i < (long long)(N); i++) #define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--) #define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++) #define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--) using namespace std; void solve(); using ll = long long; template using V = vector; using vi = vector; using vl = vector; using vvi = vector>; using vd = V; using vs = V; using vvl = vector>; using P = pair; using vp = vector

; using pii = pair; using vpi = vector>; constexpr int inf = 1001001001; constexpr long long infLL = (1LL << 61) - 1; template inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template ll ceil(T a, U b) { return (a + b - 1) / b; } constexpr ll TEN(int n) { ll ret = 1, x = 10; while (n) { if (n & 1) ret *= x; x *= x; n >>= 1; } return ret; } template ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template istream &operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } void in() {} template void in(T &t, U &... u) { cin >> t; in(u...); } void out() { cout << "\n"; } template void out(const T &t, const U &... u) { cout << t; if (sizeof...(u)) cout << " "; out(u...); } template void die(T x) { out(x); exit(0); } #ifdef NyaanDebug #include "NyaanDebug.h" #define trc(...) \ do { \ cerr << #__VA_ARGS__ << " = "; \ dbg_out(__VA_ARGS__); \ } while (0) #define trca(v, N) \ do { \ cerr << #v << " = "; \ array_out(v, N); \ } while (0) #define trcc(v) \ do { \ cerr << #v << " = {"; \ each(x, v) { cerr << " " << x << ","; } \ cerr << "}" << endl; \ } while (0) #else #define trc(...) #define trca(...) #define trcc(...) int main() { solve(); } #endif struct IoSetupNya { IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetupnya; #pragma endregion constexpr long long MOD = /** 1000000007; //*/ 998244353; template bitset gcd(bitset x, bitset y) { int xm = int(N) - 1, ym = int(N) - 1; while(xm != -1 && x[xm] == 0) xm--; while(ym != -1 && y[ym] == 0) ym--; if(xm < ym) swap(x,y), swap(xm,ym); while(ym >= 0){ x ^= y << (xm - ym); while(xm != -1 && x[xm] == 0) xm--; while(ym != -1 && y[ym] == 0) ym--; if(xm < ym) swap(x,y), swap(xm,ym); } return x; } namespace multiple_transform { template static constexpr void zeta_transform(vector &a) { int N = a.size() - 1; vector sieve(N + 1, true); for (int p = 2; p <= N; ++p) if (sieve[p]) for (int k = N / p; k > 0; --k) sieve[k * p] = false, a[k] += a[k * p]; } } // namespace multiple_transform void solve() { ini(N); vi v(N); in(v); using f2 = bitset<64>; f2 g; each(x, v) { g = gcd(g, f2(x)); } vl a(131073); each(x, v) a[x] += x; multiple_transform::zeta_transform(a); ll ans = a[1]; for (int i = 1; i < (1 << 17); i++) { ll res = 0; for (int bit = 0; bit < 17; bit++) { if ((i >> bit) & 1) res ^= g.to_ullong() << bit; } if (res > 1 << 17) continue; amin(ans, (a[1] - a[res]) + a[res] / res); } out(ans); //*/ }