#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
ll n,a[100010],fact[100010];
ll ans=0;

ll inv(ll x){
	ll ret = 1, n = MOD-2;
	
	while(n){
		if(n&1) (ret*=x)%=MOD;
		(x*=x)%=MOD;
		n>>=1;
	}
	
	return ret;
}

ll comb(int a,int b){
	ll pos = fact[a];
	ll por = fact[b];
	ll pot = fact[a-b];
	
	return pos * inv(por) % MOD * inv(pot) %MOD;
}

int main(){
	cin >> n;
	REP(i,0,n) cin >> a[i]; fact[0]=1;
	REP(i,0,n) fact[i+1]=(fact[i]*(i+1))%MOD;
	
	REP(i,0,n) (ans+=a[i]*comb(n-1,i))%=MOD;
	cout << ans << endl;
	return 0;
}