#include<iostream>
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ans=1, ap=a;
    while(k){
        if(k&1){
            ans=ans*ap%MOD;
        }
        ap=ap*ap%MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
int main(){
    int n; cin>>n;
    ll ans=0;
    ll f[100001]; f[0]=1;
    for(ll i=1; i<=n; i++){
        f[i]=f[i-1]*i%MOD;
    }
    ll invf[100001]; invf[n]=inv(f[n]);
    for(ll i=n-1; i>=0; i--){
        invf[i]=invf[i+1]*(i+1)%MOD;
    }
    for(int i=0; i<n; i++){
        ll a; cin>>a;
        ans+=(f[n-1]*invf[i]%MOD*invf[n-1-i]%MOD*a%MOD);
        ans%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}