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

const int MAX = 1;
long long dp[1005], a[MAX];

/**
 dp[i] - nr. de subsiruri cu cmmdc i
*/

int main()
{
    ifstream cin("indep.in");
    ofstream cout("indep.out");
    int n;
    cin >> n;

    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    for (int i = 1; i <= n; ++i)
    {
        for (long long j = 1; j <= 1000; ++j)
            dp[__gcd(a[i], j)] += dp[j];

        ++dp[a[i]];
    }

    cout << dp[1];

    return 0;
}