#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n; cin>>n;
    int a[55];
    vector<int> v;
    for(int i=0; i<n; i++){
        cin>>a[i];
        for(int j=1; j*j<=a[i]; j++){
            if(a[i]%j==0){
                v.push_back(j);
                if(j*j<a[i]){
                    v.push_back(a[i]/j);
                }
            }
        }
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int m=v.size();
    vector<ll> cnt(m);
    for(int i=m-1; i>=0; i--){
        int c=0;
        for(int j=0; j<n; j++){
            if(a[j]%v[i]==0) c++;
        }
        cnt[i]=(1ll<<c)-1;
        for(int j=i+1; j<m; j++){
            if(v[j]%v[i]==0) cnt[i]-=cnt[j];
        }
    }
    cout<<cnt[0]<<endl;
    return 0;
}