#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int N=1e6;
int n,fac[1000010],inv[1000010],mul[1000010],res;
vector<int>p[1000010];
inline int qpow(int a,int b){
	int res=1;
	while(b){
		if(b&1)res=1ll*res*a%mod;
		a=1ll*a*a%mod;
		b>>=1;
	}
	return res;
}
inline int C(int n,int m){
	return n<m?0:1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;
}
signed main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	fac[0]=inv[0]=1;
	for(int i=1;i<=N;i++)fac[i]=1ll*fac[i-1]*i%mod;
	inv[N]=qpow(fac[N],mod-2);
	for(int i=N-1;i;i--)inv[i]=1ll*inv[i+1]*(i+1)%mod;
	cin>>n;
	for(int i=1,x;i<=n;i++){
		cin>>x;
		for(int j=2;j*j<=x;j++)
		if(x%j==0){
			int res=0;
			while(x%j==0)res++,x/=j;
			p[j].push_back(res);
		}
		if(x>1)p[x].push_back(1);
	}
	mul[0]=(qpow(2,n-1)-1+mod)%mod;
	for(int i=1;i<n;i++)mul[i]=(mul[i-1]-C(n,i)+mod)%mod;
	for(int i=1;i<=N;i++){
		sort(p[i].begin(),p[i].end(),greater<int>());
		for(int j=0;j<p[i].size();j++)
		res=(res+1ll*p[i][j]*mul[j]%mod)%mod;
	}
	cout<<res;
	return 0;
}