#!/usr/bin/env python3


import functools


M = 10 ** 9 + 7


def sum_mod(xs, m=M):
    return functools.reduce(lambda x, y: (x + y) % m, xs) % m


class ModFact(object):

    def __init__(self, max_n, p):
        self.max_n = max_n
        self.p = p
        self.fac = [0 for _ in range(max_n)]
        self.fac[0] = self.fac[1] = 1
        self.f_inv = [0 for _ in range(max_n)]
        self.f_inv[0] = self.f_inv[1] = 1
        self.inv = [0 for _ in range(max_n)]
        self.inv[1] = 1
        for i in range(2, max_n):
            self.fac[i] = self.fac[i - 1] * i % p
            self.inv[i] = p - self.inv[p % i] * (p // i) % p
            self.f_inv[i] = self.f_inv[i - 1] * self.inv[i] % p
    
    def binom(self, n, k):
        if n < k:
            return 0
        elif n <0 or k < 0:
            return 0
        return self.fac[n] * (self.f_inv[k] * self.f_inv[n - k] % self.p) % self.p


def compute(n, bs):
    mf = ModFact(n, M)
    res = sum_mod((bs[k] * mf.binom(n - 1, k) for k in range(n)), M)
    return res


def main():
    n = int(input())
    bs = [int(b) for b in input().split()]
    res = compute(n, bs)
    print(res)


if __name__ == '__main__':
    main()