#include "bits/stdc++.h"
using namespace std;
using ll     = long long;
using pii    = pair<int, int>;
using pll    = pair<ll, ll>;
using vi     = vector<int>;
using vl     = vector<ll>;
using vvi    = vector<vi>;
using vvl    = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
    return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
    std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
    os << std::endl;
}

template <typename T = int>
void primeFactors(T a, map<T, int> &facs) {
    double sqrtA = sqrt(a);
    for (int i = 2; i <= sqrtA + 1e-10; ++i) {
        while (a % i == 0) {
            facs[i]++;
            a /= i;
        }
    }
    if (a > sqrtA)
        facs[a]++;
    return;
}

int main() {
    int n;
    cin >> n;
    vl a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    map<ll, int> facs;
    for (int i = 0; i < n; ++i) {
        primeFactors(a[i], facs);
    }
    ll ret = 1;
    for (int i = 0; i < n; ++i) {
        ret *= 2;
    }
    ret -= 1; // empty set
    set<ll> used;
    for (auto &p : facs) {
        int cnt = 0;
        for (int i = 0; i < n; ++i) {
            if (a[i] % p.first == 0)
                cnt++;
        }
        ll temp = 1;
        for (int i = 0; i < cnt; ++i) {
            temp *= 2;
        }
        temp--;
        ret -= temp;
        for (auto &u : used) {
            int cnt = 0;
            for (int i = 0; i < n; ++i) {
                if (a[i] % p.first == 0 && a[i] % u == 0)
                    cnt++;
            }
            ll temp = 1;
            for (int i = 0; i < cnt; ++i) {
                temp *= 2;
            }
            temp--;
            ret += temp;
        }
        used.insert(p.first);
    }
    cout << ret << "\n";
    return 0;
}