#include <fstream>
#include <algorithm>

using namespace std;

int N, V[502];
int Nbr[1002][202];

inline int cmmdc(int a, int b)
{
    if (b == 0) return a;
    return cmmdc(b, a % b);
}

void Plus(int Pos1, int Pos2)
{
    Nbr[Pos1][0] = max(Nbr[Pos1][0], Nbr[Pos2][0]);

    for (int i = 1; i <= Nbr[Pos1][0]; ++i)
    {
        Nbr[Pos1][i] += Nbr[Pos2][i];
        if (Nbr[Pos1][i] >= 10)
        {
            Nbr[Pos1][i + 1] += Nbr[Pos1][i] / 10;
            Nbr[Pos1][i] %= 10;
            Nbr[Pos1][0] += (i == Nbr[Pos1][0]);
        }
    }
}
void Double(int Pos)
{
    for (int i = 1; i <= Nbr[Pos][0]; ++i)
        Nbr[Pos][i] *= 2;
    for (int i = 1; i <= Nbr[Pos][0]; ++i)
        if (Nbr[Pos][i] >= 10)
        {
            Nbr[Pos][i + 1] += Nbr[Pos][i] / 10;
            Nbr[Pos][i] %= 10;
            Nbr[Pos][0] += (i == Nbr[Pos][0]);
        }
}

int main()
{
    ifstream F("indep.in");
    ofstream G("indep.out");

    Nbr[0][0] = Nbr[0][1] = 1;

    F >> N;
    for (int i = 1; i <= N; ++i)
        F >> V[i];

    for (int i = 1; i <= N; ++i)
    {
        for (int j = 1; j <= 1000; ++j)
            if (cmmdc(V[i], j) == j)
				Double(j);
            else                    
				Plus(cmmdc(V[i], j), j);
        Plus(V[i], 0);
    }

    if (Nbr[1][0] == 0) Nbr[1][0] = 1;
    for (int i = Nbr[1][0]; i >= 1; --i)
        G << Nbr[1][i];

    F.close();
    G.close();
}