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

#define rep(i, a, b) for (int i= a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (x).size()
#define int ll
#define F first
#define S second
#define PB push_back
#define MP make_pair
typedef long long int;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define endl '\n'
#define inf 3000000000000000000
#define random rand()^(rand()<<15)
mt19937 rnd(time(nullptr));

inline bool even(ll n) {
    return n % 2 == 0;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    vi cnt(21); int n, a;
    cin >> n;
    rep(i, 0, n) {
        cin >> a;
        cnt[a]++;
    }
    vector<int>v={1,11,13,17,19,7,14};
    vector<int>res;
    for(int&i:v)
    {
        if(cnt[i])
        {
            res.push_back(i);
        }
    }
    vector<int>k;
    if(cnt[2])k.push_back(2);
    if(cnt[3])k.push_back(3);
    if(cnt[5])k.push_back(5);
    int j=res.size()-1,cnt1=0;
    for(int i=1;i<=20;i++)
    {
        cnt1+=i*max(cnt[i]-1ll,0ll);
        if(cnt[i]&&i!=1&&i!=11&&i!=13&&i!=17&&i!=19&&i!=7&&i!=14)
        {
            res.push_back(i);
        }
    }
    int ans=0;
    for(int i=1;i<res.size();i++)
    {
        ans+=__gcd(res[i],res[i-1]);
    }
    for(int i=0;i<k.size();i++)
    {
        for(int l=j;l<res.size();l++)
        {
            if(res[l]==k[i])
            {
                swap(res[l],res[j]);
                break;
            }
        }
        sort(res.begin()+j+1,res.end());
        do
        {
            int ans1=0;
            for(int l=1;l<res.size();l++)
            {
                ans1+=__gcd(res[l],res[l-1]);
            }ans=max(ans,ans1);
        }while(next_permutation(res.begin()+j+1,res.end()));
    }
    cout<<ans+cnt1<<endl;
    return 0;
}