#include<atcoder/all>
using namespace std;
using mint = atcoder::modint1000000007;

int main(){
    int K, Csum = 0, gcdv = 0;
    cin >> K;
    vector<int> C(K), y;
    for(auto &&v:C){
        cin >> v;
        gcdv = __gcd(gcdv, v);
        Csum += v;
    }
    vector<mint> fact(Csum + 1), inv(Csum + 1);
    fact[0] = 1;
    for(int i = 1; i <= Csum; i++)fact[i] = i * fact[i - 1];
    inv[Csum] = 1 / fact[Csum];
    for(int i = Csum; i >= 1; i--)inv[i - 1] = i * inv[i];
    auto comb = [&](int n, int k){ return fact[n] * inv[n - k] * inv[k]; };
    for(int i = 1; i * i <= gcdv; i++){
        if(gcdv % i == 0){
            y.push_back(i);
            if(gcdv / i != i)y.push_back(gcdv / i);
        }
    }
    sort(y.rbegin(), y.rend());
    vector<mint> calc(y.size(), 1);
    mint ans;
    for(int i = 0; i < y.size(); i++){
        int d = y[i], rem = Csum / d - 1;
        for(int j = 0; j < K; j++){
            calc[i] *= comb(rem, C[j] / d - (j == 0));
            rem -= C[j] / d - (j == 0);
        }
        for(int j = 0; j < i; j++){
            if(y[j] % y[i] == 0)calc[i] -= calc[j];
        }
        ans += calc[i] / (C[0] / d);
    }
    cout << ans.val() << '\n';
}