#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint1000000007;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n;
    cin>>n;
    vector<ll> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    vector<mint> fac(n+1,1);
    for(int i = 1;i<=n;i++) fac[i] = i * fac[i-1];
    mint ans = 0;
    for(int i = 0;i<n;i++){
        mint tmp = fac[n-1] * fac[i].inv() * fac[n-1-i].inv();
        ans += tmp * a[i];
    }
    cout<<ans.val()<<endl;

}