#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 2000000000;
constexpr long long INF= 2000000000000000000;

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 0;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 1000000007;

struct Comb {
    int size;
    long long mod;
    std::vector<long long> factorial;
    std::vector<long long> inversion_factorial;
    std::vector<long long> inversion;

    Comb(int n,long long mod): size(n),mod(mod) {
        factorial.resize(n + 1);
        inversion_factorial.resize(n + 1);
        inversion.resize(n + 1);
        factorial[0] = factorial[1] = 1;
        inversion_factorial[0] = inversion_factorial[1] = 1;
        inversion[1] = 1;
        for (long long i = 2; i <= n; i++) {
            factorial[i] = factorial[i - 1] * i % mod;
            inversion[i] = mod - inversion[mod % i] * (mod / i) % mod;
            inversion_factorial[i] = inversion_factorial[i - 1] * inversion[i] % mod;
        }
    }

    long long comb(int n, int k) {
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return factorial[n] * (inversion_factorial[k] * inversion_factorial[n - k] % mod) % mod;
    }
};

int main() {
    int n;
    cin >> n;
    vector<long long> vec(n);
    for(auto& x: vec) cin >> x;

    Comb comb(n,MOD);

    long long ret = 0;
    for(int i = 0;i < n;i++) {
        ret += vec[i] * comb.comb(n - 1,i);
        ret %= MOD;
    }
    cout << ret << endl;
}