#include <fstream>
#include <algorithm>

using namespace std;

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

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

/*void add(int pos1, int pos2)
{
    num[pos1][0] = max(num[pos1][0], num[pos2][0]);

    for (int i = 1; i <= num[pos1][0]; ++i)
    {
        num[pos1][i] += num[pos2][i];
        if (num[pos1][i] >= 10)
        {
            num[pos1][i + 1] += num[pos1][i] / 10;
            num[pos1][i] %= 10;
            num[pos1][0] += (i == num[pos1][0]);
        }
    }
}
void dub(int pos)
{
    for (int i = 1; i <= num[pos][0]; ++i)
        num[pos][i] *= 2;
    for (int i = 1; i <= num[pos][0]; ++i)
        if (num[pos][i] >= 10)
        {
            num[pos][i + 1] += num[pos][i] / 10;
            num[pos][i] %= 10;
            num[pos][0] += (i == num[pos][0]);
        }
}
*/
void add (int pos1, int pos2)
{
    num[pos1][0]=1+max(num[pos1][0],num[pos2][0]);
    int zeci=0;
    for(int i=1;i<=num[pos1][0];i++)
    {
        int temp=num[pos1][i]+num[pos2][i]+zeci;
        num[pos1][i]=temp%10;
        zeci=temp/10;
    }
    if(num[pos1][num[pos1][0]]==0)
        num[pos1][0]--;
}
int main()
{
    ifstream in("indep.in");
    ofstream out("indep.out");
    num[0][0] = num[0][1] = 1;
    //num[0]=1;
    in >> N;
    for (int i = 1; i <= N; ++i)
        in >> V[i];
    for (int i = 1; i <= N; ++i)
    {
        for (int j = 1; j <= 1000; ++j)
            add(cmmdc(V[i],j),j);//num[cmmdc(V[i],j)]+=num[j];
        add(V[i],0);//num[V[i]]+=num[0];
    }
    if (num[1][0] == 0) num[1][0] = 1;
    for(int i=num[1][0];i>=1;--i)
        out<<num[1][i];
    //out<<num[1];
    in.close();
    out.close();
}