#include <bits/stdc++.h>
using namespace std;
struct T {
  int v, id;
  bool operator<(const T& t) const { return v < t.v || v == t.v && id < t.id; }
} x[300000];
int c[310000] = {0}, ans[310000] = {0};
int n;
inline void add(int x) {
  for (; x <= n; x += x & -x) c[x]++;
}
inline int sum(int x) {
  int res = 0;
  for (; x; x -= x & -x) res += c[x];
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &x[i].v), x[i].id = i;
  sort(x + 1, x + 1 + n);
  for (int i = 1; i <= n; i++) {
    add(x[i].id);
    for (int j = 1; x[i].id * j + 1 - j <= n && j < n; j++)
      ans[j] += sum(min(n, x[i].id * j + 1)) - sum(x[i].id * j + 1 - j);
  }
  for (int i = 1; i < n; i++) {
    if (i != 1) putchar(' ');
    printf("%d", ans[i]);
  }
  return 0;
}
