#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;
const double PI=acos(-1);

ll mod_pow(ll x,ll y,ll mod){
    ll res=1;
    while(y>0){ 
        if(y&1){
            res*=x;
            res%=mod;
        }
        x*=x;
        x%=mod;
        y/=2;

    }

    return res;
}

int main(){
    ll N;
    cin>>N;
    vector<ll> x(N);
    for(int i=0;i<N;i++)cin>>x[i];

    ll sumxx=0;
    ll sumx=0;
    for(ll i=0;i<N;i++){
        sumx+=x[i]%MOD;
        sumx%=MOD;

        sumxx+=x[i]*x[i]%MOD;
        sumxx%=MOD;
    }

    ll tot=0;
    tot+=sumx*sumx%MOD;
    tot-=sumxx;
    tot+=MOD;
    tot%=MOD;

    tot%=MOD;

    ll S=sumx;
    ll ans=0;
    ans+=tot*mod_pow(S,MOD-2,MOD)%MOD;
    ans%=MOD;

    ans+=1;
    ans%=MOD;


    cout<<ans<<endl;
}