#include <bits/stdc++.h>
using namespace std;
struct node {
  int val, ord;
  friend bool operator<(node n1, node n2) {
    if (n1.val == n2.val) return n1.ord < n2.ord;
    return n1.val < n2.val;
  }
} a[500005];
int n;
int s[500005], ans[500005];
void add(int x) {
  while (x <= n) {
    s[x]++;
    x += (x & -x);
  }
}
int sum(int x) {
  int res = 0;
  while (x) {
    res += s[x];
    x -= (x & -x);
  }
  return res;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].val);
    a[i].ord = i;
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    add(a[i].ord);
    for (int j = 1; j < n && a[i].ord * j - j + 2 <= n; j++) {
      ans[j] += sum(min(a[i].ord * j + 1, n)) - sum(a[i].ord * j - j + 1);
    }
  }
  for (int i = 1; i < n; i++) {
    printf("%d ", ans[i]);
  }
  return 0;
}
