#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod=1000000007;
ll gyaku(ll n){
    ll u=mod-2;
    ll ret=1;
    ll now=n;
    while(u>0){
        if(u%2==1){
            ret*=now;
            ret%=mod;
        }
        now=now*now;
        now%=mod;
        u/=2;
    }
    return ret;
}
ll nck(ll n,ll k){
    if(k>n)swap(n,k);
    if(2*k>n)k=n-k;
    ll ret=1;
    for(ll i=0;i<k;i++){
        ret*=n-i;
        ret%=mod;
        ret*=gyaku(i+1);
        ret%=mod;
    }
    return ret;
}
int main(){
    ll n;cin>>n;
    ll a[n];for(ll i=0;i<n;i++)cin>>a[i];
    ll ans=0;
    ll f[n];
    f[0]=1;
    for(ll i=1;i<n;i++){
        f[i]=f[i-1]*(n-i);
        f[i]%=mod;
        f[i]*=gyaku(i);
        f[i]%=mod;
    }
    for(ll i=0;i<n;i++){
        ans+=f[i]*a[i];
        ans%=mod;
    }
    cout<<ans<<endl;
}