#include //#include //using namespace atcoder; using namespace std; using ll = long long; using vll = vector; using vvll = vector; using vvvll = vector; using vb = vector; using vvb = vector; using vvvb = vector; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) using pqr = priority_queue, vector>, greater>>; template bool chmax(T& p, T q) { if (p < q) { p = q; return 1; } else { return 0; } } template bool chmin(T& p, T q) { if (p > q) { p = q; return 1; } else { return 0; } } ll gcd(ll(a), ll(b)) { ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll Eugrid(ll A, ll B, ll& x, ll& y) { if (B == 0) { x = 1; y = 0; return A; } ll C = gcd(A, B); ll D = Eugrid(B, A % B, y, x); y -= A / B * x; return D; }//Ax+By=gcd(A,B)の解 vector fact, factinv, inv; ll mod = 1e9 + 7; void prenCkModp(ll n) { fact.resize(n + 5); factinv.resize(n + 5); inv.resize(n + 5); fact.at(0) = fact.at(1) = 1; factinv.at(0) = factinv.at(1) = 1; inv.at(1) = 1; for (ll i = 2; i < n + 5; i++) { fact.at(i) = (fact.at(i - 1) * i) % mod; inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod; factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod; } } ll nCk(ll n, ll k) { if (n < k) return 0; return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N; cin>>N; prenCkModp(N); ll an=0; rep(i,N){ ll A; cin>>A; an+=nCk(N-1,i)*A; an%=mod; } cout<