#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include using namespace std; typedef long long ll; #define rep(i, n) for(int i = 0; i < (n); i++) #define rep1(i, n) for(int i = 1; i <= (n); i++) #define co(x) cout << (x) << "\n" #define cosp(x) cout << (x) << " " #define ce(x) cerr << (x) << "\n" #define cesp(x) cerr << (x) << " " #define pb push_back #define mp make_pair #define chmin(x, y) x = min(x, y) #define chmax(x, y) x = max(x, y) #define Would #define you #define please int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; int A[100000]; int hist[200001] = {}; int ikeru[200001] = {}; ll goukei = 0; rep(i, N) { cin >> A[i]; hist[A[i]]++; ikeru[A[i]] = 1; ikeru[A[i] * 2] = 1; goukei += A[i]; } vector hist2; rep(i, 100001) { if (hist[i]) hist2.pb(i); } int s = hist2.size(); int hist3[200001] = {}; rep1(i, (1 << 17) - 1) { if (!ikeru[i]) { rep(j, s) if (hist[hist2[j] ^ i]) ikeru[i] = 1;; } } ll saidai = 0; rep1(j, 200000) { if (ikeru[j]) { ll kari = 0; rep(i, N) { if (A[i] % j == 0) { kari += A[i] - A[i] / j; } } chmax(saidai, kari); } } co(goukei - saidai); Would you please return 0; }