#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],o[10005],e[10005];
int l;
int merge(int x,int y){
	x*=y;
	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;
		}
	}
	return r;
}
signed main(){
	n=read();
	for(int i=2;i<=n;i++){
		if(!p[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;
	}
	int p=0;
	for(int i=0;i<(1<<l);i++){
		int tmp=1;
		for(int j=1;j<=l;j++)if(i&(1<<(j-1)))tmp=merge(tmp,w[j]);
		if(tmp==1)p++;
	}
	coef*=p;coef%=mod;
	cout<<(coef-1+mod)%mod<<"\n";
	return 0;
}
//look at my code
//my code is amazing