#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

ll p2(ll k){
    ll num=2,ret=1;
    while(k){
        if(k&1) ret=ret*num;
        num=num*num;
        k>>=1;
    }
    return ret;
}

void mugen1337(){
    int n;cin>>n;
    vector<ll> a(n);
    rep(i,n) cin>>a[i];
    ll ans=0;
    for(int bit=1;bit<(1<<n);bit++){
        ll g=0;
        rep(i,n)if((bit>>i)&1)g=gcd(g,a[i]);
        if(g==1) ans++;
    }
    cout<<ans<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n;cin>>n;
    vector<ll> a(n);
    rep(i,n) cin>>a[i];

    set<ll> st;
    rep(i,n){
        for(ll j=1;j*j<=a[i];j++){
            if(a[i]%j) continue;
            st.insert(j);
            st.insert(a[i]/j);
        }
    }
    st.erase(1);

    map<ll,ll> mp;
    for(auto x:st){
        ll cnt=0;
        rep(i,n) if(a[i]%x==0) cnt++;
        mp[-x]=p2(cnt)-1;
    }

    ll mx=*max_element(ALL(a));
    for(auto p:mp){
        ll num=-p.first;
        for(ll i=2;i*i<=num;i++){
            if(num%i) continue;
            ll x=i,y=num/i;
            mp[-x]-=p.second;
            if(x!=y) mp[-y]-=p.second;
        }
    }
    ll res=0;
    for(auto p:mp){
        res+=p.second;
    }
    cout<<p2(n)-1-res<<endl;
    return 0;
}