#include <iostream>
#include <numeric>
#include <algorithm>
#include <vector>
#include <map>

template <class T>
std::vector<T> divisors(T n) {
    std::vector<T> ret;
    for (T p = 1; p * p <= n; ++p) {
        if (n % p != 0) continue;
        ret.push_back(p);
        if (n / p == p) continue;
        ret.push_back(n / p);
    }
    return ret;
}

template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());

    std::map<T, int> rev;
    for (int i = 0; i < (int)v.size(); ++i) rev[v[i]] = i;
    return rev;
}

using lint = long long;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> xs(n);
    std::vector<int> ps{0};
    for (auto& x : xs) {
        std::cin >> x;
        for (auto p : divisors(x)) {
            ps.push_back(p);
        }
    }

    auto revp = compress(ps);
    int m = ps.size();

    std::vector<lint> dp(m, 0);
    dp[0] = 1;
    auto ndp = dp;

    for (auto x : xs) {
        for (int i = 0; i < m; ++i) {
            int j = revp[std::gcd(x, ps[i])];
            ndp[j] += dp[i];
        }
        dp = ndp;
    }

    std::cout << dp[1] << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}