#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

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

int main() {
    ll N, A, MOD = 1e9 + 7, ans = 0;
    cin >> N;
    vector<ll> p(N + 1, 1);
    rep(i, N) p[i + 1] = (p[i] * (i + 1)) % MOD;
    rep(i, N) {
        cin >> A;
        A *= p[N - 1];
        A %= MOD;
        A *= mod_pow(p[i], MOD - 2, MOD);
        A %= MOD;
        A *= mod_pow(p[N - 1 - i], MOD - 2, MOD);
        A %= MOD;
        ans = (ans + A) % MOD;
    }
    cout << ans << "\n";
}