import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      const ASum = A.sum;
      const AMax = A.maxElement;
      auto cnt = new long[cast(int)(AMax + 1)];
      foreach (i; 0 .. N) {
        ++cnt[cast(int)(A[i])];
      }
      
      long[] basis;
      foreach (i; 0 .. N) {
        long a = A[i];
        foreach (base; basis) {
          chmin(a, a ^ base);
        }
        if (a != 0) {
          basis ~= a;
        }
      }
      
      long ans = ASum;
      foreach (k; 1 .. A.maxElement + 1) {
        long a = k;
        foreach (base; basis) {
          chmin(a, a ^ base);
        }
        if (a == 0) {
          long now = ASum;
          for (long l = k; l <= AMax; l += k) {
            now -= (l - l / k) * cnt[cast(int)(l)];
          }
          debug {
            writeln(k, ": ", now);
          }
          chmin(ans, now);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}