#include<iostream>
#include<vector>
#include<queue>
#include<string>
using namespace std;

long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}

#define MOD 1000000007
int main(){
    int N;
    cin >> N;
    vector<long long> A(N);
    for(int i=0;i<N;i++) cin >> A[i];
    vector<long long> factorial(N,1),nCr(N);
    for(int i=1;i<N;i++) factorial[i] = (factorial[i-1]*i) % MOD;
    for(int i=0;i<N;i++) {
        nCr[i] = factorial[N-1] * modinv(factorial[N-1-i],MOD) % MOD * modinv(factorial[i],MOD) % MOD;
    } 

    int ans = 0;
    for(int i=0;i<N;i++) ans += nCr[i]*A[i] % MOD;

    cout << ans << endl;
}