#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
//#include<boost/multiprecision/cpp_int.hpp>
//namespace mp=boost::multiprecision;
//using Bint=mp::cpp_int;
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//using mint=modint1000000007;
using mint=modint998244353;
//const ll mod=1000000007;
const ll mod=998244353;
//using mint=modint;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
int main(){
  ll N;cin>>N;
  vector<ll>A(N);cin>>A;
  vector<vector<ll>>factor(N);
  REP(i,N){
    ll d=2;
    while(d*d<=A[i]){
      ll cnt=0;
      while(A[i]%d==0)cnt++,A[i]/=d;
      if(cnt%2)factor[i].emplace_back(d);
      d++;
    }
    if(A[i]>1)factor[i].emplace_back(A[i]);
  }
  set<ll>p;
  REP(i,N)for(auto a:factor[i])p.insert(a);
  vector<ll>prime;
  for(auto a:p)prime.emplace_back(a);
  vector<mint>hash(N+1);
  vector<bool>X(sz(prime));
  REP(i,N){
    hash[i]=hash[i-1];
    for(auto a:factor[i]){
      ll t=LB(prime,a);
      if(X[t])hash[i]-=pow_mod(2,t,mod);
      else hash[i]+=pow_mod(2,t,mod);
      X[t]=!X[t];
    }
  }
  vector<ll>Q(N+1);
  REP(i,N+1)Q[i]=hash[i].val();
  sort(ALL(Q));
  ll ans=0;
  REP(i,N+1){
    ll c=COU(Q,Q[i]);
    ans+=c*(c-1)/2;
    i=UB(Q,Q[i])-1;
  }
  cout<<ans<<endl;
  return 0;
}