#include <bits/stdc++.h>
using namespace std;
#define modulo 10000000
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000

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

int main(){
    
	int N;
	cin>>N;
	
	vector<int> A(N);
	for(int i=0;i<N;i++){
		cin>>A[i];
	}
	
	map<int,long long> mp;
	mp[0] = 1;
	
	for(int i=0;i<N;i++){
		map<int,long long> n_mp;
		for(auto &a:mp){
			n_mp[a.first] += a.second;
			n_mp[gcd(a.first,A[i])]+=a.second;
		}
		mp = n_mp;
	}
	
	cout<<mp[1]<<endl;
	
    return 0;
}