#include<cstdio>
typedef long long LL;
const int N=1e6+5,md=1e9+7;
int n,mx[N],a[N];
inline int pow(int a,int b){
	int ret=1;
	for(;b;b>>=1,a=(LL)a*a%md)if(b&1)ret=(LL)ret*a%md;
	return ret;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d",a+i);
		int x=a[i];
		for(int i=2;i*i<=x;++i)
		if(x%i==0){
			int cnt=0;
			while(x%i==0)++cnt,x/=i;
			if(cnt>mx[i])mx[i]=cnt;
		}
		if(x>1&&!mx[x])mx[x]=1;
	}
	int s=1,ans=0;
	for(int i=1;i<=1000000;++i)
	if(mx[i])s=1ll*s*pow(i,mx[i])%md;
	for(int i=1;i<=n;++i)
	ans=(ans+(LL)s*pow(a[i],md-2))%md;
	printf("%d",ans);
	return 0;
}