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

const int maxn = 2e5 + 5;
int a[maxn];

int main()
{
    int n, diff = 0;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] != a[i - 1] && i != 1)
            diff = 1;
    }

    if (!diff)
        cout << a[1] * 2;
    else
    {
        sort(a + 1, a + n + 1, greater<int>());
        int cnt = unique(a + 1, a + n + 1) - (a + 1);

        int l = 0, r = 0;
        for (int i = 1; i <= cnt; i++)
        {
            if (l == 0)
                l = a[i];
            else if (r == 0)
                r = a[i];
            else
            {
                int lt = l - __gcd(l, a[i]),
                    rt = r - __gcd(r, a[i]);
                if (lt < rt)
                    l = __gcd(l, a[i]);
                else
                    r = __gcd(r, a[i]);
            }
        }

        cout << l + r;
    }

    system("Pause");
    return 0;
}