#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int gcd(int a, int b){
    if(b == 0)return a;
    return gcd(b, a % b);
}

const int MOD = 1e9 + 7;
const int MAX = 1000010;

ll fact[MAX], fact_inv[MAX];
ll mod_pow(ll x, ll e){
    ll v = 1;
    for(;e;e>>=1){
        if(e & 1)v = (v * x) % MOD;
        x = (x * x) % MOD;
    }
    return v;
}
void init(){
    fact[0] = 1;
    for(int i=1;i<MAX;i++)
        fact[i] = i * fact[i-1] % MOD;

    fact_inv[MAX-1] = mod_pow(fact[MAX-1], MOD - 2);
    for(int i=MAX-2;i>=0;i--){
        fact_inv[i] = (i + 1) * fact_inv[i + 1] % MOD;
    }
}

ll comb(int n, int k){
    ll res = fact[n] * fact_inv[k] % MOD;
    res = res * fact_inv[n-k] % MOD;
    return res;
}

vector<int> ps, divs;
void init_n(int n){
    for(int d=1;d*d<=n;d++)if(n % d == 0){
        divs.push_back(d);
        if(n / d != d)
            divs.push_back(n / d);
    }
    for(int p=2;p*p<=n;p++)if(n % p == 0){
        ps.push_back(p);
        while(n % p == 0)
            n /= p;
    }
    if(n > 1)
        ps.push_back(n);
}


int euler(int n){
    int res = n;
    for(int p : ps){
        if(n % p == 0)
            res = res / p * (p - 1);
    }
    return res;
}


int K, C[100010];
int main(){
    cin >> K;
    for(int i=0;i<K;i++)
        cin >> C[i];
    
    int N = 0;
    for(int i=0;i<K;i++)
        N += C[i];
    
    int g = 0;
    for(int i=0;i<K;i++)
        g = gcd(g, C[i]);
    
    
    init();
    init_n(N);
    
    ll res = 0;
    for(int d : divs){
        int block_size = N / d;
        int block_num = N / block_size;
        
        if(g % block_size != 0)
            continue;
        
        ll tmp = euler(N / d);
        
        for(int i=0;i<K;i++){
            int use = C[i] / block_size;
            tmp *= comb(block_num, use);
            tmp %= MOD;
            block_num -= use;
        }
        
        res = res + tmp;
        res %= MOD;
    }
    
    res *= mod_pow(N, MOD - 2);
    res %= MOD;
    
    cout << res << endl;
    return 0;
}