#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int n;
int ans[maxn];
int tree[maxn];
struct node {
  int val;
  int id;
  bool friend operator<(const node u, const node v) { return u.val < v.val; }
} p[maxn];
int lowbit(int k) { return k & (-k); }
void add(int x) {
  while (x <= n) {
    tree[x] += 1;
    x += lowbit(x);
  }
}
int get_sum(int x) {
  int ans = 0;
  while (x) {
    ans += tree[x];
    x -= lowbit(x);
  }
  return ans;
}
void solve() {
  int pos = 1;
  for (int i = 1; i <= n; i = pos) {
    while (pos <= n && p[pos].val == p[i].val) {
      pos++;
    }
    for (int j = i; j < pos; j++) {
      int id = p[j].id;
      for (int k = 1; k <= n - 1 && k * (id - 1) + 2 <= n; k++) {
        ans[k] += get_sum(min(n, k * id + 1)) - get_sum(k * (id - 1) + 1);
      }
    }
    for (int j = i; j < pos; j++) {
      add(p[j].id);
    }
  }
  for (int i = 1; i <= n - 1; i++) {
    cout << ans[i] << " ";
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p[i].val;
    p[i].id = i;
  }
  sort(p + 1, p + 1 + n);
  solve();
}
