#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<map>
using namespace std;
#define INF 100000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> P;
typedef pair< pair<int,int>, int> p; 
#define bit(n,k) ((n>>k)&1) /*nのk bit目*/

//https://yukicoder.me/submissions/392116

ll GCD(ll a,ll b){
    return ((b==0) ? a:GCD(b,a%b));
}

int main(){
    int N;
    cin>>N;
    vector<int> A(N);
    for(int i=0;i<N;i++) cin>>A[i];
    vector<map<int,ll> > dp(N);
    ll ans=0;

    for(int i=0;i<N;i++){
        dp[i][A[i]]++;
        for(int j=i+1;j<N;j++){
            for(auto e:dp[i]){
                dp[j][GCD(e.first,A[j])]+=e.second;
            }
        }
        ans+=dp[i][1];
    }
    cout<<ans<<endl;
    return 0;
}