//
// Created by yamunaku on 2019/10/25.
//

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> mti;
typedef vector<ll> vl;
typedef vector<vector<ll>> mtl;

int gcd(int x, int y){
    while(x % y){
        int tmp = x % y;
        x = y;
        y = tmp;
    }
    return y;
}

int main(){
    int n;
    cin >> n;
    vi a(n);
    rep(i, n) cin >> a[i];
    map<int, int> mp;
    rep(i, n){
        vi s;
        int tmp = a[i];
        repl(j, 2, sqrt(tmp) + 1){
            if(tmp % j == 0){
                while(tmp % j == 0) tmp /= j;
                s.push_back(j);
            }
        }
        if(tmp > 1) s.push_back(tmp);
        int sz = s.size();
        repl(j, 1, 1 << sz){
            tmp = 1;
            int c = 0;
            rep(k, sz){
                if(j & (1 << k)) tmp *= s[k], c++;
            }
            mp[tmp] = c;
        }
    }
    ll ans = (1ll << n) - 1;
    for(auto &p:mp){
        int c = 0;
        rep(i, n){
            if(a[i] % p.first == 0) c++;
        }
        if(p.second % 2){
            ans -= (1ll << c) - 1;
        }else{
            ans += (1ll << c) - 1;
        }
    }
    cout << ans << endl;
    return 0;
}