#include <bits/stdc++.h>
using namespace std;
struct Node {
  Node *son[2];
  int s;
} * Root[200010], *Null;
Node *Insert(Node *root, int l, int r, int x) {
  Node *p = new Node;
  p->son[0] = root->son[0], p->son[1] = root->son[1], p->s = root->s + 1;
  if (l == r) return p;
  int mid = (l + r) >> 1;
  if (x <= mid)
    p->son[0] = Insert(p->son[0], l, mid, x);
  else
    p->son[1] = Insert(p->son[1], mid + 1, r, x);
  return p;
}
int getsum(Node *p, int l, int r, int x, int y) {
  if ((!p->s) || (l == x && r == y)) return p->s;
  int mid = (l + r) >> 1;
  if (y <= mid)
    return getsum(p->son[0], l, mid, x, y);
  else if (mid < x)
    return getsum(p->son[1], mid + 1, r, x, y);
  else
    return getsum(p->son[0], l, mid, x, mid) +
           getsum(p->son[1], mid + 1, r, mid + 1, y);
}
int n, a[200010];
void read() {
  Null = new Node;
  Null->son[0] = Null->son[1] = Null, Null->s = 0;
  Root[0] = Null;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    Root[i] = Insert(Root[i - 1], -1000000010, 1000000010, a[i]);
  }
}
void print() {
  static int ans[200010];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j * (i - 1) + 2 <= n && j < n; ++j)
      ans[j] += getsum(Root[min(n, i * j + 1)], -1000000010, 1000000010,
                       -1000000010, a[i] - 1) -
                getsum(Root[j * (i - 1) + 1], -1000000010, 1000000010,
                       -1000000010, a[i] - 1);
  for (int i = 1; i < n; ++i) printf("%d%c", ans[i], i < n - 1 ? ' ' : '\n');
}
int main() {
  read();
  print();
  return 0;
}
