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

#define REP(i,x,y) for(ll i=x; i<=y; i++)
#define BIT(t) ((long long 1) << t)
#define PER(i,y,x) for(ll i=y; i>=x; i--)
#define SIZE(v) ll(v.size())
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll,ll>
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
typedef long long ll;

void f(ll y, set<ll>& st){
        ll x = y;
        for(int i=1;i*i<=x;i++){
                if(y % i == 0){
                        st.insert(i);
                        st.insert(y/i);
                }
        }
}

int main(){
        ll n;
        cin >> n;
        vll a;
        REP(i,1,n){
                ll x;
                cin >> x;
                a.push_back(x);
        }
        set<ll> st;
        REP(i,0,n-1){
                f(a[i], st);
        }
        vll v;
        for(auto x:st){
                v.push_back(x);
        }
        reverse(v.begin(), v.end());
        vll num(v.size());
        for(int i=0;i<v.size();i++){
                ll x = v[i];
                ll cnt = 0;       
                REP(j,0,n-1){
                        if(a[j] % x == 0){
                                cnt++;
                        }
                }
                ll tmp = pow(2,cnt) - 1;
                num[i] += tmp;
                for(int j=i+1;j < v.size();j++){
                        if(v[i] % v[j] == 0){
                                num[j] -= num[i];
                        }
                }
        }
        ll sum = 0;
        REP(i,0,SIZE(v)-1){
                sum += num[i];
        }
        cout << num[num.size() - 1] << endl;
}