#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC oprimize("unrol-loops")

#define vec vector
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define int long long

using namespace std;

typedef pair<int, int> pii;

const int inf = 2e18;
int mod = 100000007;


void solve()
{
    int ans = 0;
    int n;
    cin>>n;
    vec<int> a;
    vec<int> kol(30, 0);
    for(int i = 0; i<n; i++)
    {
        int x;
        cin>>x;
        if(x != 2 && x!=4 && x != 8 && x != 16 && x != 3 && x != 9)
        {
            if(kol[x]==0)
                a.push_back(x);
            else
                ans+=x;
        }
        kol[x]++;
    }
    bool flag = false;
    int ind = 1;


    int max_dv = 0;
    int max_tr = 0;

    for(int p=2; p<=20; p*=2)
    {
        if(kol[p])
        {
            if(flag)
                ans+=ind;
            if(!flag)
            {
                flag = true;
                a.push_back(p);
            }
            ans+=(kol[p]-1)*p;
            ind = p;
            max_dv=p;
        }
    }

    flag = false;
    ind = 1;
    for(int p=3; p<=20; p*=3)
    {
        if(kol[p])
        {
            if(flag)
                ans+=ind;
            if(!flag)
            {
                flag = true;
                a.push_back(p);
            }
            ans+=(kol[p]-1)*p;
            ind = p;
            max_tr = p;
        }
    }

    map<pii, int> gcd;
    for(int i = 1;i<=20;i++){
        for(int j = 1;j<=20;j++){
            gcd[{i, j}] = __gcd(i, j);
        }
    }


    vec<int> b;

    for(int i = 0; i<a.size(); i++)
    {
        if(a[i]==1 || a[i] == 11 || a[i] == 13 || a[i] == 17 || a[i] == 19)
        {
            ans +=1;
        }
        else
            b.push_back(a[i]);
    }

    sort(all(b));

    int ma = 0;


  //  cout << ans << "\n";

    vec<int> ans2;

    do
    {

        int pl = 0;

        vec<int> c = b;
        if(b[0] == 2)
        {
            c[0] = max_dv;
        }

        if(b[b.size()-1] == 2)
        {
            c[b.size()-1] = max_dv;
        }

        if(b[0] == 3)
        {
            c[0] = max_tr;
        }

        if(b[b.size()-1] == 3)
        {
            c[b.size()-1] = max_tr;
        }



        for(int i = 0; i<c.size()-1; i++)
        {
            if(c[i+1] == 2)
            {
                if(i+2 < c.size())
                {
                    int ans1 = 0;
                    ans1 = gcd[{c[i], c[i+1]}] + gcd[{max_dv, c[i+2]}];
                    ans1 = max(ans1, gcd[{c[i+2], c[i+1]}] + gcd[{max_dv, c[i]}]);
                    pl += ans1;
                    i++;
                }
                else
                {
                    pl += gcd[{c[i], c[i+1]}];
                   /// pl += __gcd(c[i], c[i+1]);
                }
            }
            else
            {
                if(c[i+1] == 3)
                {
                    if (i + 2 < c.size())
                    {
                        int ans1 = 0;
                        ans1 = gcd[{c[i], c[i+1]}] + gcd[{max_tr, c[i+2]}];
                        ans1 = max(ans1, gcd[{c[i+2], c[i+1]}] + gcd[{max_tr, c[i]}]);
                        ///ans1 = __gcd(c[i], c[i+1]) + __gcd(max_tr, c[i+2]);
                        ///ans1 = max(ans1,  __gcd(c[i+2], c[i+1]) + __gcd(max_tr, c[i]));
                        pl += ans1;
                        i++;
                    }
                    else
                    {
                        pl += gcd[{c[i], c[i+1]}];
                        ///pl += __gcd(c[i], c[i+1]);
                    }
                }
                else
                {
                    pl += gcd[{c[i], c[i+1]}];
                    ///pl += __gcd(c[i], c[i+1]);
                }
            }
        }

        ///cout << pl << "\n";
        /* for(int i = 1; i<b.size()-1; i+=2)
         {
             if(b[i]==2)
                 pl+=max(__gcd(b[i], b[i-1])+__gcd(max_dv, b[i+1]),__gcd(b[i], b[i+1])+__gcd(max_dv, b[i-1]));
             else if(b[i]==3)
                 pl+=max(__gcd(b[i], b[i-1])+__gcd(max_tr, b[i+1]),__gcd(b[i], b[i+1])+__gcd(max_tr, b[i-1]));
             else{
                 pl+=(__gcd(b[i], b[i-1])+__gcd(b[i], b[i+1]));
             }
         }
         if(b.size()%2==0)
             pl+=__gcd(b[b.size()-1],b[b.size()-2]);
             */
        /// ma = max(ma, pl);
        ma = max(ma, pl);
        /*if(pl > ma)
        {
            ma = pl;
            ans2 = b;
            for(int j = 0; j<b.size(); j++)
                cout << b[j] << " ";
            cout << "\n";
            for(int j = 0; j<b.size(); j++)
                cout << c[j] << " ";
            cout << "\n";
            cout << pl << "\n";
        }*/

    }
    while(next_permutation(all(b)));

   /// cout << ma << "\n";
    ans += ma;
    cout << ans << "\n";

}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tests = 1;
    while(tests--)
    {
        solve();
    }
}