#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)
#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
using P = pair<int,int>; using vp = vector<P>;
constexpr int MOD = /** 1000000007; //*/ 998244353;
////////////////

// c++17での名前衝突を避けるためdefine
#define gcd nyagcd
#define lcm nyalcm
ll nyagcd(ll x, ll y){
  ll z;
  if(x > y) swap(x,y);
  while(x){
    x = y % (z = x); y = z;
  }    
  return y;
}
ll nyalcm(ll x,ll y){
  return 1LL * x / gcd(x,y) * y;
}

bitset<10000001> sieve;

struct divisor_transform{
  template <typename T>
  static constexpr void zeta_transform(vector<T> &a){
    int N = a.size() - 1; 
    for(int p = 2; p <= N; p++)
      if(sieve[p])
        for(int k = 1; k * p <= N; ++k)
          a[k * p] += a[k];    
  }

  template<typename T>
  static constexpr void mobius_transform(T &a){
    int N = a.size() - 1; 
    for(int p = 2; p <= N; p++)
      if(sieve[p])
        for(int k = N / p; k > 0; --k)
          a[k * p] -= a[k];    
  }

};

struct multiple_transform{
  template <typename T>
  static constexpr void zeta_transform(vector<T> &a){
    int N = a.size() - 1;
    for(int p = 2; p <= N; ++p)
      if(sieve[p])
        for(int k = N / p; k > 0; --k)
          a[k] += a[k * p];
  }
  template <typename T>
  static constexpr void mobius_transform(vector<T> &a){
    int N = a.size() - 1;
    for(int p = 2; p <= N; ++p)
      if(sieve[p])
        for(int k = 1; k * p <= N; ++k)
          a[k] -= a[k * p];
  }

};

void solve(){
  ini(N);
  vl v(N ); in(v);
  if(N == 1) die(v[0] == 1);
  int x = N / 2 , y = N - N / 2;
  vi s(1 << x) , t(1 << y);
  s[0] = t[0] = 0;
  trc(x , y);
  rep(b, 1 << x){
    if(b == 0) continue;
    s[b] = gcd(s[b ^ (b & -b)] , v[__builtin_ctz(b & -b)]);
  }
  rep(b , 1 << y){
    if(b == 0) continue;
    t[b] = gcd(t[b ^ (b & -b)] , v[x + __builtin_ctz(b & -b)]);
  }
  unordered_map<int,ll> a , b;
  each(x , s) a[x]++;
  each(x , t) b[x]++;
  each(x , a) trc(x);
  each(x , b) trc(x);
  ll ans = 0;
  each(x , a) each(y , b){
    if(gcd(x.fi , y.fi) == 1) ans += x.se * y.se;
  }
  out(ans);
  trc(gcd(0  ,1)); trc(gcd(1 , 1));
}