#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;

const int MOD = 1e9 + 7;

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

int main() {
	int n; scanf("%d", &n); std::vector<i64> a(n);
	for(int i = 0; i < n; i++) scanf("%lld", &a[i]);
	
	std::vector<i64> fact(n + 1, 1);
	for(int i = 0; i < n; i++) fact[i + 1] = fact[i] * (i + 1) % MOD;
	
	std::function<i64 (int, int)> comb = [&](int n, int r) {
		return fact[n] * mod_pow(fact[r]) % MOD * mod_pow(fact[n - r]) % MOD;
	};
	
	int ans = 0;
	for(int i = 0; i < n; i++) (ans += a[i] * comb(n - 1, i) % MOD) %= MOD;
	
	printf("%d\n", ans);
	return 0;
}