#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=1e9+7;
int n;
int a[10005];
bool p[10005];
int cnt[10005];
int qkp(int b,int pw){
	int r=1;
	while(pw){
		if(pw&1)(r*=b)%=mod;
		pw/=2;
		(b*=b)%=mod;
	}
	return r;
}
int w[10005];
int l;
int pr[10005];
int len;
bool b[3200][3200];
signed main(){
	n=read();
	for(int i=2;i<=n;i++){
		if(!p[i]){
			pr[++len]=i;
			for(int j=i*2;j<=n;j+=i)p[j]=1;
		}
	}
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++){
		int x=i;
		int r=1;
		for(int j=2;j<=n;j++){
			if(!p[j]){
				int c=0;
				while(x%j==0)x/=j,c++;
				if(c&1)r*=j;
			}
		}
		cnt[r]+=a[i];
	}
	int coef=qkp(2,cnt[1]);
	for(int i=2;i<=n;i++){
		if(!cnt[i])continue;
		w[++l]=i;
		coef*=qkp(2,cnt[i]-1);coef%=mod;
	}
	for(int i=1;i<=len;i++){
		//x[1]*contain(pr[i])+x[2]+...
		for(int j=1;j<=l;j++){
			if(w[j]%pr[i]==0){
				b[i][j]=1;
			}
		}
		//考虑选择若干个. 使得加起来和是 mod 2 为 0 的.
	}
	//自由元个数
	int v=1;
	for(int i=1;i<=l;i++){
		for(int j=v;j<=len;j++){
			if(b[j][i]){
				if(j!=v){
					for(int k=1;k<=l;k++)swap(b[j][k],b[v][k]);
				}
				for(int k=v+1;k<=len;k++){
					if(b[k][i]){
						for(int x=1;x<=l;x++)b[k][x]^=b[v][x];
					}
				}
				v++;break;
			}
		}
	}
	cout<<(qkp(2,l-v+1)*coef%mod+mod-1)%mod<<"\n";
	return 0;
}
//look at my code
//my code is amazing