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

const long long MOD = 1000000007ll;
long long fact[100100];

long long power ( long long x, long long n ) {
    long long ans = 1;
    while ( n > 0 ) {
        if ( n & 1 ) {
            ans = ( ans * x ) % MOD;
        }
        x = ( x * x ) % MOD;
        n >>= 1;
    }
    return ans;
}
long long ans;
signed main () {

    fact[0] = 1;
    for ( int i = 1; i <= 100001; i++ ) {
        fact[i] = fact[i-1] * i;
        fact[i] %= MOD;
    }

    long long n;
    scanf("%lld", &n);
    for ( int i = 0; i < n; i++ ) {
        long long a;
        scanf("%lld", &a);
        ans += a * ( ( fact[n-1] * power ( (fact[i]*fact[n-1-i])%MOD, MOD-2) ) % MOD );
        ans %= MOD;
    }
    printf("%lld\n", ans);
    return 0;
}