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

//divisor O(sqrt(N))
set<long long> Divisor(long long N) {
    set<long long> ret;
    for (long long i = 1; i*i <= N; ++i) {
        if (N%i == 0) {
            ret.insert(i);
            ret.insert(N / i);
        }
    }
    return ret;
}

//Greatest Common Divisor
long long GCD(long long a, long long b) {
    return ((b == 0) ? a : GCD(b, a % b));
}

//bit全探索愚直解
int main() {
	int N,MAX_A = 1000; cin >> N;
	vector<int> A(N);
	for(int i = 0; i < N; ++i) cin >> A[i];

	long long ans = 0;
	for(int i = 1; i < (1<<N); ++i) {
		int cnt = 0;
		for(int j = 0; j < N; ++j) {
			if(i&(1<<j)) cnt = GCD(cnt,A[j]);
		}
		if(cnt == 1) ans++;
	}
	cout << ans << endl;
	return 0;
}