N = int(input())
A = list(map(int, input().split()))

mod = 10**9+7
factorial = [1]
for n in range(1, N+1):
    factorial.append( factorial[n-1] * n % mod)

invFact = [0] * (N+1)
invFact[N] = pow(factorial[N], mod-2, mod)

for n in range(N-2+1, -1, -1):
    invFact[n] = invFact[n+1] * (n+1) % mod

def combi(n,m):
    try:
        return factorial[n] * invFact[m] * invFact[n-m] % mod
    except:
        print(n, m)

# print(factorial, invFact)
coeff = [0] * (N)
for i in range(N):
    # coeff[i] = combi( max(N-i-1, i) , N-1 - max(N-i-1,i))
    coeff[i]  =  factorial[N-1] * invFact[  max(N-i-1, i) ] * invFact[ N-1 - max(N-i-1,i)]  % mod
    # print(i, max(N-i-1, i), N-1-max(N-i-1,i), coeff[i])

# print(coeff)
ans = 0

for i in range(N):
    ans = (ans + coeff[i] * A[i] % mod) % mod
print(ans)