#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int A[50];
vector<int> V;

ll num[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>A[i];
		for(j=1;j*j<=A[i];j++) if(A[i]%j==0) {
			V.push_back(j);
			V.push_back(A[i]/j);
		}
	}
	sort(ALL(V));
	V.erase(unique(ALL(V)),V.end());
	
	FOR(i,V.size()) {
		x=0;
		FOR(y,N) if(A[y]%V[i]==0) x++;
		num[i]=(1LL<<x)-1;
	}
	for(i=V.size()-1;i>=0;i--) {
		FOR(x,i) if(V[i]%V[x]==0) num[x]-=num[i];
	}
	cout<<num[0]<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}