// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

const size_t buf_size = 1ll << 10;
ll buf[buf_size];

int main() {
    ll N;
    cin >> N;
    V<ll> A(N);
    for(auto &&ele : A) cin >> ele;
    VV<ll> plis(N);
    for(ll i = 0; i < N; i++) {
        ll e = A[i];
        for(ll j = 2; j * j <= A[i]; j++) {
            ll cnt = 0;
            while(e % j == 0) {
                e /= j;
                cnt++;
            }
            if(cnt) plis[i].push_back(j);
        }
        if(1 < e) plis[i].push_back(e);
    }

    DEBUG(plis);

    ll ans = 0;
    for(ll i = 0; i < N; i++) {
        V<ll> dp(1ll << plis[i].size());
        dp.back() = 1;
        for(ll j = i + 1; j < N; j++) {
            for(ll i = 0; i < dp.size(); i++) buf[i] = dp[i];
            ll mask = dp.size() - 1;
            for(ll k = 0; k < plis[i].size(); k++) if(A[j] % plis[i][k]) mask ^= (1ll << k);
            for(ll i = 0; i < dp.size(); i++) dp[i & mask] += dp[i];
        }
        ans += dp[0];
    }
    cout << ans << endl;
    return 0;
}