#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
#define sz(x) ((ll)(x).size())
#define For(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define vec vector
const ll MOD = 1e9+7;

template<typename T>
ostream& operator<<(ostream &os, const vector<T> &cont) {
    for (auto it = cont.begin(); it != cont.end(); ++it)
        os << (it == cont.begin() ? "" : " ") << *it;
    return os;
}

template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> &cont) {
    os << "(" << cont.first << ", " << cont.second << ")";
    return os;
}

vec<vec<ll>> memo(1<<22, vec<ll>(22));
int maxa=21;
ll solve (ll m, int l){
    if(memo[m][l])return memo[m][l];
    memo[m][l] = 0;
    For(i, 1, maxa){
        if(m&(1<<i)){
            memo[m][l] = max(memo[m][l], solve(m^(1<<i), i) + gcd(l, i));
        }
    }
    return memo[m][l];
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;cin>>n;
    vec<int> a(n);
    ll m=0;
    For(i, 0, n){
        cin>>a[i];
        if(!(m&1<<a[i]))m|=(1<<a[i]);
    }
    vec<int> poc(maxa);
    for(auto i:a){
        poc[i]++;
    }
    ll ans = solve(m, 1) - 1;
    For(i, 0, maxa){
        if(poc[i]>1) ans += (poc[i]-1)*i;
    }
    cout<<ans<<endl;
}