#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 30;

// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
  ll b = m, u = 1, v = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}

int main() {
  int n;
  cin >> n;
  vector<ll> ncr(n);
  ncr[0] = 1;
  for (int i = 0; i < n - 1; i++) {
    ncr[i + 1] = ncr[i] * (n - 1 - i) * modinv(i + 1, MOD) % MOD;
  }

  ll a, ans = 0;
  for (int i = 0; i < n; i++) {
    cin >> a;
    ans = (ans + (a * ncr[i] % MOD)) % MOD;
  }
  cout << ans << endl;
}