#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#define MAXN 1000010
#define MOD 1000000007
using namespace std;
vector<int> stack;
int n,c=1,d=1,T;
int head[MAXN],deep[MAXN],vis[MAXN],num[MAXN];
long long bit[MAXN],dp[MAXN][2];
bool used[MAXN],choose[MAXN];
struct Edge{int next,to;
}a[MAXN];
inline int read(){int date=0,w=1;char c=0;while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}while(c>='0'&&c<='9'){date=date*10+c-'0';c=getchar();}return date*w;
}
inline long long sqr(long long x){return x*x;}
int gcd(int x,int y){if(!y)return x;return gcd(y,x%y);
}
inline void add(int x,int y){a[c].to=y;a[c].next=head[x];head[x]=c++;a[c].to=x;a[c].next=head[y];head[y]=c++;
}
void build(){int m=MAXN-10;for(int i=1;i<=m/2;i++)for(int j=i+1;j<=m/2/i&&sqr(j)-sqr(i)<=m;j++)if(((i&1)!=(j&1))&&gcd(i,j)==1)add(2LL*i*j,sqr(j)-sqr(i));bit[0]=1;for(int i=1;i<=m;i++)bit[i]=(bit[i-1]<<1)%MOD;
}
inline void insert(int x){if(!used[x]){used[x]=true;stack.push_back(x);}
}
bool check(int u,int f){vis[u]=T;for(int i=head[u];i;i=a[i].next){int v=a[i].to;if(v==f||!num[v])continue;if(choose[u]&&choose[v])return false;if(vis[v]!=T)if(!check(v,u))return false;}return true;
}
void dfs1(int x,int f){deep[x]=d++;for(int i=head[x];i;i=a[i].next){int v=a[i].to;if(!num[v]||v==f)continue;if(!deep[v])dfs1(v,x);else if(deep[v]<deep[x]){insert(x);insert(v);}}
}
void dfs2(int x,int f){vis[x]=T;dp[x][0]=1;dp[x][1]=(bit[num[x]]-1+MOD)%MOD;if(used[x]){if(choose[x])dp[x][0]=0;else dp[x][1]=0;}for(int i=head[x];i;i=a[i].next){int v=a[i].to;if(v==f||!num[v]||vis[v]==T)continue;if(vis[v]!=T)dfs2(v,x);dp[x][0]=dp[x][0]*(dp[v][0]+dp[v][1])%MOD;dp[x][1]=dp[x][1]*dp[v][0]%MOD;}
}
void dfs3(int i,int m,int x,long long &ans){if(i==m){T++;if(check(x,-1)){T++;dfs2(x,-1);ans=(ans+dp[x][0]+dp[x][1])%MOD;}return;}choose[stack[i]]=false;dfs3(i+1,m,x,ans);choose[stack[i]]=true;dfs3(i+1,m,x,ans);
}
long long solve(int x){stack.clear();dfs1(x,-1);int m=stack.size();long long ans=0;dfs3(0,m,x,ans);return ans;
}
void work(){long long ans=1;for(int i=1;i<=MAXN-10;i++)if(num[i]&&!deep[i])ans=ans*solve(i)%MOD;printf("%lld\n",(ans-1+MOD)%MOD);
}
void init(){n=read();for(int i=1;i<=n;i++){int x=read();num[x]++;}
}
int main(){build();init();work();return 0;
}