#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

/*void print_bit(int x) {
  int mask = 1 << 10;
  while (mask) {
    if (x & mask) cout << 1;
    else cout << 0;
    mask >>= 1;
  }
  cout << endl;
}

signed main() {
  int n;
  cin >> n;
  vi a(n);
  rep (i, n) {
    cin >> a[i];
  }

  bool update = true;
  int m = 1000;
  vector<bool> used(m + 1);
  rep (i, n) {
    used[a[i]] = true;
  }
  while (update) {
    update = false;
    rep1 (i, m) {
      if (not used[i]) continue;
      int x = i * 2;
      while (x <= m) {
        if (not used[x]) {
          used[x] = true;
          update = true;
        }
        x *= 2;
      }
    }
    rep1 (i, m) {
      if (not used[i]) continue;
      for (int j = i + 1; j <= m; j++) {
        if (not used[j]) continue;
        if (not used[(i ^ j)]) {
          used[(i ^ j)] = true;
          update = true;
        }
      }
    }
  }

  rep (i, m + 1) {
    if (used[i]) {
      cout << i << " ";
      print_bit(i);
    }
  }
}
//*/

signed main() {
  int n;
  cin >> n;
  vl a(n);
  rep (i, n) cin >> a[i];

  const int m = 1000000;
  vi sub(m + 1);
  rep (i, n) {
    for (int x = 1; x * x <= a[i]; x++) {
      if (a[i] % x == 0) {
        int y = a[i] / x;
        sub[x] += a[i] - a[i] / x;
        if (x != y) {
          sub[y] += a[i] - a[i] / y;
        }
      }
    }
  }

  priority_queue<pii> pq;
  rep (i, m + 1) {
    if (sub[i] >= 1) {
      pq.push(pii(sub[i], i));
    }
  }

  bitset<2 * m + 1> used;
  rep (i, n) {
    int x = a[i];
    while (x <= 2 * m) {
      used[x] = true;
      x *= 2;
    }
  }

  ll ans = 0;
  rep (i, n) {
    ans += a[i];
  }

  while (pq.size() > 0) {
    pll temp = pq.top();
    pq.pop();
    ll x = temp.second;
    if (used[x]) {
      cout << ans - sub[x] << endl;
      return 0;
    }
    for (int i = 0; i <= 2 * m; i++) {
      if (used[i]) {
        ll y = x ^ i;
        if (used[y]) {
          cout << ans - sub[x] << endl;
          return 0;
        }
      }
    }
  }
}