#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = 0;
//---------------------------------//

using pll = pair<ll, ll>;
const int SIZE = 2000;

// nを素因数分解する (素因数, 個数)が戻り値
vector<pll> primeFactorization(ll n) {
	vector<pll> res;
	
	for (ll i = 2; i * i <= n; i++) {
		if (n % i == 0) res.push_back(pll(i, 0));
		while (n % i == 0) {
			n /= i;
			res.back().second++;
		}
	}
	if (n > 1) res.emplace_back(n, 1);
	
	return res;
}

// [l, r)
ll solve(int l, int r, int k, vector<bitset<SIZE> > &bs) {
	if (k < 0) return 0;
	ll res = 0;
	
	while (k >= 0) {
		int firc = 0, secc = 0, pos = -1;
		FOR(i, l, r) {
			if (bs[i][k] == 0) firc++;
			else {
				secc++;
				if (pos == -1) pos = i;
			}
		}
		if (firc > 0 && secc > 0) {
			res += ((1ll<<firc)-1) * ((1ll<<secc)-1);
			res += solve(l, pos, k - 1, bs);
			res += solve(pos, r, k - 1, bs);
			
			// printf("%d %d %d %d\n", l, pos, r, k);
			break;
		}
		k--;
	}
	return res;
}


int main() {
	int N; cin >> N;
	vector<int> A(N);
	REP(i, N) cin >> A[i];
	
	vector<vector<pll> > pf(N);
	REP(i, N) pf[i] = primeFactorization(A[i]);
	
	map<ll, int> mm;
	REP(i, N) REP(j, pf[i].size()) {
		if (mm.find(pf[i][j].fi) == mm.end()) mm[pf[i][j].fi] = mm.size() - 1;
	}
	
	vector<bitset<SIZE> > bs(N);
	// REP(i, N) REP(j, pf[i].size()) {
	// 	assert(mm[pf[i][j].fi] < SIZE);
	// 	bs[i][mm[pf[i][j].fi]] = true;
	// }
	
	// sort(ALL(bs), [&](auto x, auto y) {
	// 	return x.to_string() < y.to_string();
	// });
	
	// REP(i, N) cout << bs[i] << endl;
	
	int onc = 0;
	REP(i, N) if (A[i] == 1) onc++;
	
	ll ans = solve(0, N, mm.size(), bs);
	ans += (1ll<<onc)-1;
	cout << ans << endl;
	return 0;
}