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

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
  }*/

int gcd(int a, int b){
  if(b == 0) return a;
  return gcd(b, a%b);
}

signed main(){
  int n;
  cin >> n;

  vi a(n);
  rep(i, 0, n) cin >> a[i];

  vi div;
  for(int i : a) rep(j, 1, i/j+1){
    if(i%j == 0){
      div.emplace_back(j);
      div.emplace_back(i/j);
    }
  }

  div.emplace_back(inf);
  div.emplace_back(-1);
  sort(all(div));
  div.erase(unique(all(div)), div.end());
  int m = sz(div);

  vvi dp(n+1, vi(m+1, 0));
  rep(i, 0, n){
    rep(j, 0, m+1){
      dp[i+1][j] += dp[i][j];
      if(div[j] == -1){
        int to = lower_bound(all(div), a[i]) - div.begin();
        dp[i+1][to] = 1;
      }else{
        int g = gcd(div[j], a[i]);
        int to = lower_bound(all(div), g) - div.begin();
        dp[i+1][to] += dp[i][j];
      }
    }
  }

  int t = lower_bound(all(div), 1LL) - div.begin();
  cout << dp[n][t] << endl;

//  rep(i, 0, m) cout << div[i] << " ";
//  cout << endl;
//
//  rep(i, 0, n+1){
//    rep(j, 0, m+1) cout << dp[i][j] << " ";
//    cout << endl;
//  }

  return 0;
}