#include <bits/stdc++.h>
const int MAXN = 2e5 + 10;
int n;
int a[MAXN], ans[MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  for (int o = 1; o < n; ++o) {
    for (int i = 1, j; i < o; i = j + 1) {
      j = (o - 1) / ((o - 1) / i);
      if (a[o] < a[(o - 1) / i]) ++ans[i], --ans[j + 1];
    }
    if (a[o] < a[0]) ++ans[o];
  }
  for (int i = 1; i < n; ++i)
    printf("%d%c", ans[i] += ans[i - 1], " \n"[i == n - 1]);
  return 0;
}
