#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;
lint fact[105];
int n, a[105];
int main(){
cin >> n;
fact[0] = 1;
for(int i=1; i<=n; i++){
fact[i] = fact[i-1] * i % mod;
}
lint ret = 0, ps = 0;
for(int i=1; i<=n; i++){
int t;
cin >> t;
ret = ret * i + t - 1;
ret %= mod;
ps += fact[i-1];
cout << (ret + ps) % mod << endl;
}
}
