#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vll a(n);get(a);
  ll ans = (1LL<<n) - 1;
  //gcdがxになる
  map<ll, ll> candi;
  for(ll i=0;i<n;i++) for(ll j=1;j*j<=a[i];j++) if(a[i]%j==0) candi.emplace(j, 0), candi.emplace(a[i]/j, 0);

  for(auto itr = --candi.end();;itr--){
    ll cnt = 0;
    ll num = (*itr).first;
    if(num==1) break;
    for(int i=0;i<n;i++) if(a[i]%num==0) cnt++;
    ll tmp = (1LL<<cnt) - 1;
    for(auto e:candi) if(e.first>num&&e.first%num==0) tmp -= e.second;
    candi[num] = tmp;
    ans -= tmp;
  }
  std::cout << ans << '\n';
}