#include #define rep(i, n) for(int(i) = 0; (i) < (n); (i)++) #define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++) #define ALL(v) (v).begin(), (v).end() #define LLA(v) (v).rbegin(), (v).rend() #define PB push_back #define MP(a, b) make_pair((a), (b)) using namespace std; template inline vector make_vec(size_t a, T val) { return vector(a, val); } template inline auto make_vec(size_t a, Ts... ts) { return vector(a, make_vec(ts...)); } template inline T read() { T t; cin >> t; return t; } template inline vector readv(size_t sz) { vector ret(sz); rep(i, sz) cin >> ret[i]; return ret; } template inline tuple reads() { return {read()...}; } template struct edge { int to; T cost; edge(int t, T c) : to(t), cost(c) {} }; using ll = long long; using pii = pair; using pll = pair; using Graph = vector>; template using WGraph = vector>>; const int INF = 1 << 30; const ll LINF = 1LL << 60; const int MOD = 1e9 + 7; set divisor(ll n) { set ret; for(ll i = 1; i * i <= n; i++) { if(n % i == 0) { ret.insert(i); if(i * i != n) ret.insert(n / i); } } return ret; } template class ModInt { using u64 = uint_fast64_t; public: u64 val; ModInt(const u64 x = 0) : val((x + MOD) % MOD) {} constexpr u64 &value() { return val; } constexpr ModInt operator-() { return val ? MOD - val : 0; } constexpr ModInt operator+(const ModInt &rhs) const { return ModInt(*this) += rhs; } constexpr ModInt operator-(const ModInt &rhs) const { return ModInt(*this) -= rhs; } constexpr ModInt operator*(const ModInt &rhs) const { return ModInt(*this) *= rhs; } constexpr ModInt operator/(const ModInt &rhs) const { return ModInt(*this) /= rhs; } constexpr ModInt &operator+=(const ModInt &rhs) { val += rhs.val; if(val >= MOD) { val -= MOD; } return *this; } constexpr ModInt &operator-=(const ModInt &rhs) { if(val < rhs.val) { val += MOD; } val -= rhs.val; return *this; } constexpr ModInt &operator*=(const ModInt &rhs) { val = val * rhs.val % MOD; return *this; } constexpr ModInt &operator/=(const ModInt &rhs) { *this *= rhs.inv(); return *this; } constexpr bool operator==(const ModInt &rhs) { return this->val == rhs.val; } constexpr bool operator!=(const ModInt &rhs) { return this->val != rhs.val; } friend constexpr ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; } friend constexpr istream &operator>>(istream &is, ModInt &x) { return is >> x.val; } constexpr ModInt inv() const { return ModInt(*this).pow(MOD - 2); } constexpr ModInt pow(ll e) const { u64 x = 1, p = val; while(e > 0) { if(e % 2 == 0) { p = (p * p) % MOD; e /= 2; } else { x = (x * p) % MOD; e--; } } return ModInt(x); } }; using mint = ModInt; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N = read(); auto A = readv(N); map dp; for(int i = 0; i < N; i++) { for(auto [gcd, num] : dp) { dp[__gcd(gcd, A[i])] += dp[gcd]; } dp[A[i]] += 1; } cout << dp[1] << endl; }