#define _CRT_SECURE_NO_DEPRECATE
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>
#include <stack>
#include <deque>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <bitset>
#define mpair make_pair
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const ld epsylon = 1e-9;

ll mod = 1000007;

ll sb[1024], sa[1024];
ll bb[1024], ba[1024];

ll comb[1024][1024];


int main()
{
  freopen("median.in","r",stdin);
  freopen("median.out", "w", stdout);
  
  memset(comb, 0, sizeof(comb));

  comb[0][0] = 1;
  comb[1][0] = comb[1][1] = 1;
  for (int i=1;i<1024;++i) {
    comb[i][0] = comb[i][i] = 1;
    for (int j=1;j<i;++j) {
      comb[i][j] = (comb[i-1][j-1] + comb[i-1][j]) % mod;
    }
  }

  int n;
  cin >> n;
  vector<int> a(n);
  for (int i=0;i<n;++i){
    scanf("%d", &a[i]);
  }

  memset(sa, 0, sizeof(sa));
  memset(sb, 0, sizeof(sb));
  memset(ba, 0, sizeof(ba));
  memset(bb, 0, sizeof(bb));
  

  for (int i=0;i<n;++i) {
    for (int j=0;j<i;++j) {
      if (a[j] < a[i]) {
        sb[i]++;
      } else if (a[j] > a[i]) {
        bb[i]++;
      }
    }
    
    for (int j=i+1; j <n;++j) {
      if (a[j] < a[i]) {
        sa[i]++;
      } else if (a[j] > a[i]) {
        ba[i]++;
      }
    }
  }

  vector<int> b(n);
  for (int i=0;i<n;++i){
    ll res = 0;
    for (int l = 1;l <= n;++l) {
      if (l%2 == 1) {
        res = (res + (comb[sb[i] + sa[i]][l/2] * comb[ba[i] + bb[i]][l/2])% mod) % mod;
      } else {
        res = (res + (comb[sb[i] + sa[i]][l/2] * comb[ba[i] + bb[i]][l/2 - 1])% mod) % mod;
      }
    }

    b[i] = (int) res;
  }

  //for(int i=0;i<n;++i) {
  //  printf("%d%c", b[i], ((i+1==n)?'\n':' '));
  //}
  for(int i=0;i<n;++i) {
    printf("%d", b[i]);
    if (i + 1 != n) printf(" ");
  }
  return 0;
}