#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nmax=100005;
const int mod=1e9+7;
ll fac[nmax],finv[nmax],inv[nmax];
 
void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<nmax;i++){
    fac[i]=fac[i-1]*i%mod;
    inv[i]=mod-inv[mod%i]*(mod/i)%mod;
    finv[i]=finv[i-1]*inv[i]%mod;
  }
}
ll com(int n,int k){
  if(n<k||n<0||k<0){
    return 0;
  }
  return fac[n]*(finv[k]*finv[n-k]%mod)%mod;
}
int main(){
    ll n;cin >> n;
    COMinit();
    ll ans=0;
    for(int i=0;i<n;i++){
        ll a;cin >> a;
        ans+=a*com(n-1,i)%mod;
        ans%=mod;
    }
    cout << ans << endl;
}