#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
ll f[1000010], invf[1000010];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i%MOD;
    invf[n]=inv(f[n]);
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD;
}
ll comb(int x, int y){
    if(!(0<=y && y<=x)) return 0;
    return f[x]*invf[y]%MOD*invf[x-y]%MOD;
}
int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b, a%b);
}
int main()
{
    int k;
    cin>>k;
    int c[100010];
    int g=0, s=0;
    for(int i=0; i<k; i++){
        cin>>c[i];
        s+=c[i];
        g=gcd(g, c[i]);
    }
    fac(s);
    vector<int> vd;
    for(int i=1; i<=g; i++){
        if(g%i==0) vd.push_back(i);
    }
    int m=vd.size();
    vector<ll> cnt(m);
    ll ans=0;
    for(int i=m-1; i>=0; i--){
        cnt[i]=f[s/vd[i]];
        for(int j=0; j<k; j++){
            (cnt[i]*=invf[c[j]/vd[i]])%=MOD;
        }
        for(int j=i+1; j<m; j++){
            if(vd[j]%vd[i]==0) (cnt[i]+=MOD-cnt[j])%=MOD;
        }
        (ans+=cnt[i]*inv(s/vd[i]))%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}