#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("indep.in");
ofstream fout("indep.out");
#define COST 1002
#define MAX 502

int a[MAX];
unsigned long long n, b[MAX][COST];

int main()
{
    int i, j;
    fin>>n;

    for(i=1;i<=n;i++)
    {
        fin>>a[i];
    }
    for(i=1;i<=n;i++)
    {
        b[i][a[i]]=1;
        for(j=1;j<=COST;j++)
        {
            b[i][j]+=b[i-1][j];
            b[i][__gcd(j, a[i])]+=b[i-1][j];
        }
    }
    fout << b[n][1] << "\n";

}