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

ll mod = 1e9+7;

ll inv(ll x) {
    ll res = 1;
    ll k = mod - 2;
    ll y = x;
    while (k) {
        if (k & 1) res = (res * y) % mod;
        y = (y * y) % mod;
        k /= 2;
    }
    return res;
}

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

    ll ans = 0;
    ll c = 1;
    for(ll i=0; i<N; i++){
        ans += (c%mod)*a[i];
        ans = ans%mod;
        c = (((N-1-i)*c)%mod)*inv(i+1);
        c = c%mod;
    }
    cout << ans << endl;    
}