#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
#include <memory>
#include <regex>
using namespace std;

void integerFactorization(int n, vector<pair<int, int> >& factor)
{
    factor.clear();
    int a = 2;
    while(a * a <= n){
        int b = 0;
        while(n % a == 0){
            ++ b;
            n /= a;
        }
        if(b > 0)
            factor.push_back(make_pair(a, b));
        ++ a;
    }
    if(n > 1)
        factor.push_back(make_pair(n, 1));
}

int gcd(int a, int b){
    while(b != 0){
        int tmp = a % b;
        a = b;
        b = tmp;
    }
    return a;
}

int main()
{
    int n;
    cin >> n;
    vector<int> a(n, 1);
    for(int i=0; i<n; ++i){
        int x;
        cin >> x;
        vector<pair<int, int> > v;
        integerFactorization(x, v);
        for(const auto& p : v)
            a[i] *= p.first;
    }

    map<int, long long> dp;
    for(int i=0; i<n; ++i){
        map<int, long long> nextDp;
        nextDp[a[i]] = 1;
        for(const auto& p : dp){
            nextDp[p.first] += p.second;
            int g = gcd(p.first, a[i]);
            nextDp[g] += p.second;
        }
        dp = move(nextDp);
    }
    cout << dp[1] << endl;
}