#include <bits/stdc++.h>
using namespace std;

template<class Z> vector<Z> divisor(Z n) {
  vector<Z> res;
  Z i;
  for (i = 1; i * i < n; ++i) if (n % i == 0) res.push_back(i), res.push_back(n / i);
  if (i * i == n) res.push_back(i);
  sort(begin(res), end(res));
  return res;
}

constexpr int sup = 1e5;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n), v;
  vector<long long> s(sup + 1);
  long long sum = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    for (int d : divisor(a[i])) {
      s[d] += a[i] - a[i] / d;
    }
    int t = a[i];
    for (int e : v) {
      t = min(t, t ^ e);
    }
    if (t) {
      v.push_back(t);
    }
    sum += a[i];
  }
  int m = v.size();
  long long res = sum;
  for (int S = 1; S < 1 << m; ++S) {
    int x = 0;
    for (int j = 0; j < m; ++j) {
      if (S >> j & 1) {
        x ^= v[j];
      }
    }
    if (x <= sup) {
      res = min(res, sum - s[x]);
    }
  }
  cout << res << '\n';
}