#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr int INF = 1 << 30;

int N, Q, K;
string S;
map<int, bool> m;

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int N; cin >> N;
  vector<int> A(N);

  for(int i = 0; i < N; ++i) {
    cin >> A[i];
    m[A[i]] = 1;
  }

  int g = A[0];
  for(int i = 1; i < N; ++i) {
    int a = g, b = A[i];
    while(a % b != 0) {
      int c = a % b;
      a = b, b = c;
    }
    g = b;
  }
  
  bool ok = false;
  for(int i = 0; i < N; ++i) {
    if(A[i] == g) {
      ok = true;
      break;
    }
    int tg = g;
    while(tg) {
      if(m[tg ^ A[i]]) ok = true;
      tg >>= 1;
    }
  }

  long long ans = 0;
  for(int i = 0; i < N; ++i) {
    if(ok && A[i] % g == 0) ans += A[i] / g;
    else ans += A[i];
  }
  cout << ans << endl;

  return 0;
}