#include <bits/stdc++.h>
using namespace std;
const int nmax = 210000;
int n;
int a[nmax];
int violated[nmax];
void gen(int m) {
  int k = 1;
  int p = (m - 1) / k;
  while (p > 0) {
    int kprime = (m - 1) / p + 1;
    int pprime = (m - 1) / kprime;
    assert(pprime < p);
    if (a[p] > a[m]) {
      violated[k]++;
      violated[kprime]--;
    }
    k = kprime;
    p = pprime;
  }
  if (a[0] > a[m]) violated[k]++;
}
int main() {
  memset(violated, 0, sizeof(violated));
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
  }
  for (int i = n - 1; i > 0; --i) {
    gen(i);
  }
  long long sum = 0;
  for (int i = 1; i < n; ++i) {
    sum += violated[i];
    cout << sum << " ";
  }
  cout << "\n";
}
