#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,v) for(auto i=v.begin();i!=v.end();++i)
#define REACH(i,v) for(auto i=v.rbegin();i!=v.rend();++i)
#define LB(c,x) distance((c).begin(),lower_bound(ALL(c),x))
#define UB(c,x) distance((c).begin(),upper_bound(ALL(c),x))
#define COUNT(c,x) (upper_bound(ALL(c),x)-lower_bound(ALL(c),x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DUMP(x)  cerr<<#x<<" = "<<(x)<<endl;
#define NL cerr<<endl;
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T sum(vector<T>&v){return accumulate(ALL(v),T());}
template<typename T>T sum(vector<T>&v,int a,int b){return accumulate(v.begin()+a,v.begin()+b,T());}
template<typename T>T max(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T min(vector<T>&v){return *min_element(ALL(v));}
template<typename T>T max_index(vector<T>&v){return distance((v).begin(),max_element(ALL(v)));}
template<typename T>T min_index(vector<T>&v){return distance((v).begin(),min_element(ALL(v)));}

struct edge { int to, cost; };

template<typename T>auto&operator<<(ostream&s,const vector<T>&v){s<<"[";bool a=1;for(auto e:v){s<<(a?"":" ")<<e;a=0;}s<<"]";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const pair<T,U>&p){s<<"("<<p.first<<","<<p.second<<")";return s;}
template<typename T>auto&operator<<(ostream&s,const set<T>&st){s<<"{";bool a=1;for(auto e:st){s<<(a?"":" ")<<e;a=0;}s<<"}";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const map<T,U>&m){s<<"{";bool a=1;for(auto e:m){s<<(a?"":" ")<<e.first<<":"<<e.second;a=0;}s<<"}";return s;}


const int INF = 1e18;
const int MOD_N = 1e9+7;

struct GF {
   int mod, x;
   GF(){}
   GF(int a, int m=MOD_N) : mod(m) { x = ((a % mod) + mod) % mod; }
   GF& operator=(const GF& a) {
      x = a.x;
      return *this;
   }
   GF& operator=(int a) {
      return *this = GF(a);
   }

   GF power(int n) const {
      GF tmp = x;
      GF res = 1;
      while (n > 0) {
         if ((n & 1) == 1) res *= tmp;
         tmp *= tmp;
         n >>= 1;
      }
      return res;
   }
   GF operator-() const {
      return GF((-x + mod) % mod);
   }
   GF inverse() const {
      return GF(power(mod-2));
   }

   GF& operator+=(const GF& a) { 
      (x += a.x) %= mod;
      return *this;
   }
   GF& operator-=(const GF& a) {
      return *this += -a;
   }
   GF& operator*=(const GF& a) {
      (x *= a.x) %= mod;
      return *this;
   }
   GF& operator/=(const GF& a) {
      return *this *= a.inverse();
   }

   GF& operator+=(int a) {
      return *this *= GF(a);
   }
   GF& operator-=(int a) {
      return *this += -GF(a);
   }
   GF& operator*=(int a) {
      return *this *= GF(a);
   }
   GF& operator/=(int a) {
      return *this /= GF(a);
   }

   const GF operator+(const GF& a) const {
      return GF(x) += a;
   }
   const GF operator-(const GF& a) const {
      return GF(x) -= a;
   }
   const GF operator*(const GF& a) const {
      return GF(x) *= a;
   }
   const GF operator/(const GF& a) const {
      return GF(x) /= a;
   }

   const GF operator+(int a) const {
      return GF(x) += a;
   }
   const GF operator-(int a) const {
      return GF(x) -= a;
   }
   const GF operator*(int a) const {
      return GF(x) *= a;
   }
   const GF operator/(int a) const {
      return GF(x) /= a;
   }
};
auto&operator<<(ostream&s,const GF&a){s<<a.x;return s;}

vector<GF> frac;
void init_frac(int N) {
   frac.resize(N+1);
   frac[0] = 1;
   for (int i = 1; i <= N; i++) {
      frac[i] = frac[i-1] * i;
   }
}

signed main()
{
   int n; cin >> n;
   V<GF> a(n);
   REP(i, n) {
      int A; cin >> A;
      a[i] = A;
   }

   V<GF> s(n+1);
   FORE(i, 1, n) {
      s[i] = s[i-1] + GF(i).inverse();
   }

   GF ans = 0;
   init_frac(n);
   REP(i, n) {
      ans += (s[i+1] + s[n-i] - 1) * frac[n] * a[i];
   }
   cout << ans << endl;

   return 0;
}


Measured memory_bytes: 4992