#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin ("indep.in");
ofstream fout ("indep.out");

long long dp[501][1001]; //dp[i][j] = nr subsiruri care se termina in elementul i cu cmmdc j
vector <int> nenul[501];

int cmmdc(int x, int y)
{
    while (y)
    {
        int r = x%y;
        x = y;
        y = r;
    }
    return x;
}
int main()
{
    int x,n;
    fin >> n >> x;
    dp[1][x] = 1;
    nenul[1].push_back(x);
    for (int i=2; i<=n; i++)
    {
        fin >> x;
        for (int j=1; j<i; j++)
        {
            for (int k : nenul[j])
            {
                int c = cmmdc(x,k);
                if (dp[i][c] == 0)
                    nenul[i].push_back(c);
                dp[i][c] += dp[j][k];
            }
        }
    }
    long long s = 0;
    for (int i=1; i<=n; i++)
        s += dp[i][1];
    fout << s;
}