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

//入力が必ず-mod<a<modの時.
template<const int mod>
struct modint{ //mod変更が不可能.
    public:
    long long v = 0;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint(){v = 0;} modint(int a){v = a<0?a+mod:a;} modint(long long a){v = a<0?a+mod:a;}
    modint(unsigned int a){v = a;} modint(unsigned long long a){v = a;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint operator/=(modint b){ //b!=0 mod素数が必須.
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
    modint operator++(){*this += 1; return *this;}
    modint operator--(){*this -= 1; return *this;}
    modint operator++(int){*this += 1; return *this;}
    modint operator--(int){*this -= 1; return *this;}
    bool operator==(const modint b)const{return v == b.v;}
    bool operator!=(const modint b)const{return v != b.v;}
    bool operator>(const modint b)const{return v > b.v;}
    bool operator>=(const modint b)const{return v >= b.v;}
    bool operator<(const modint b)const{return v < b.v;}
    bool operator<=(const modint b)const{return v <= b.v;}
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return modint(1)/v;} //素数mod必須.
};
using mint = modint<1000000007>;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int Limit = 1001001; //Limit->必要なサイズ fac->x! facinv->1/x! inv->1/x.
    vector<mint> fac(Limit+1,1),facinv(Limit+1);
    {
        int mod = mint::getmod(),invstart = min(mod-1,Limit); 
        for(int i=1; i<=Limit; i++) fac.at(i) = fac.at(i-1)*i;
        facinv.at(invstart) = fac.at(invstart).inv();
        for(int i=invstart-1; i>=0; i--) facinv.at(i) = facinv.at(i+1)*(i+1);
    }
    //vector<mint> inv(Limit+1); for(int i=1; i<=Limit; i++) inv.at(i) = fac.at(i-1)*facinv.at(i); //必要なら解放.
    auto nCr = [&](int n,int r) -> mint {
        if(n < r || r < 0 || n < 0) return 0;
        return fac.at(n)*facinv.at(r)*facinv.at(n-r);
    };

    int N; cin >> N;
    vector<int> A(N);
    int n = 0;
    for(auto &a : A) cin >> a,n += a;
    
    vector<mint> div(n+1,1);
    vector<int> D,G(n+1);
    for(int i=1; i<=n; i++) G.at(gcd(n,i))++;
    vector<bool> NG(n+1);
    for(int i=1; i*i<=n; i++){
        if(n%i) continue;
        D.push_back(i);
        if(i*i != n) D.push_back(n/i);
    }
    sort(D.begin(),D.end());

    vector<int> ap(n+1);
    vector<int> apap;
    for(auto a : A){
        ap.at(a)++;
        if(ap.at(a) > 1) continue;
        apap.push_back(a);
        for(auto d : D){
            long long v = a;
            v *= d;
            if(v%n) NG.at(d) = true;  
        }
    }
    sort(apap.begin(),apap.end());

    mint answer = 0;
    for(auto d : D){
        if(NG.at(d)) continue;
        int gs = G.at(d);
        mint now = fac.at(d),div = 1;
        for(auto a : apap){
            int c = ap.at(a);
            div *= fac.at(1LL*a*d/n).pow(c);
        }
        now /= div,now *= gs;
        answer += now;
    }
    answer /= n;
    cout << answer.v << endl;
}