//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007, MAXN = 10'000;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

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

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

template<typename T>
T square(T a) {
	return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
	ll operator() (pair<ll, ll> p) const {
		return ((__int128)p.first * MOD + p.second) % INF64;
	}
};

ll binpow(ll a, ll b) {
	return (b == 0 ? 1 : square(binpow(a, b / 2)) % MOD * (b % 2 ? a : 1) % MOD);
}

ll inv(ll x) {
	return binpow(x, MOD - 2);
}

ll f[MAXN], invf[MAXN];

void precalc() {
	f[0] = 1;
	for (ll i = 1; i < MAXN; i++) {
		f[i] = f[i - 1] * i % MOD;
	}
	invf[MAXN - 1] = inv(f[MAXN - 1]);
	for (ll i = MAXN - 1; i > 0; i--) {
		invf[i - 1] = invf[i] * i % MOD;
	}
}

ll Merge(ll n, ll k) {
	return f[n + k - 2] * invf[n - 1] % MOD;
}

void solve() {
	ll n;
	cin >> n;
	vector<ll> arr(n);
	vector<ll> pref(1, 0);
	for (ll i = 0; i < n; i++) {
		cin >> arr[i];
		pref.push_back(pref.back() + arr[i]);
	}
	vector<vector<vector<ll>>> dp(n, vector<vector<ll>>(n));
	for (ll i = 0; i < n; i++) {
		dp[i][i].resize(1, 1);
	}
	for (ll len = 2; len <= n; len++) {
		for (ll l = 0; l + len <= n; l++) {
			ll r = l + len - 1;
			dp[l][r].resize(len, 0);
			ll fir = 0, sec = 0;
			for (ll mid = l; mid < r; mid++) {
				if (pref[mid + 1] - pref[l] > pref[r + 1] - pref[mid + 1]) {
					for (ll num = 0; num < mid - l + 1; num++) {
						dp[l][r][num] = (dp[l][r][num] + dp[l][mid][num] * Merge(mid - l + 1, r - mid) % MOD) % MOD;
					}
				} else {
					for (ll num = 0; num < r - mid; num++) {
						dp[l][r][mid - l + 1 + num] = (dp[l][r][mid - l + 1 + num] + dp[mid + 1][r][num] * Merge(r - mid, mid - l + 1) % MOD) % MOD;
					}
				}
			}
		}
	}
	for (ll i = 0; i < n; i++) {
		cout << dp[0].back()[i] * invf[n - 1] % MOD << '\n';
	}
}

int main() {
	if (IS_FILE) {
		freopen("", "r", stdin);
		freopen("", "w", stdout);
	}
    	ios_base::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
	precalc();
	ll t = 1;
	if (IS_TEST_CASES) {
		cin >> t;
	}
	for (ll i = 0; i < t; i++) {
		solve();
	}
}