#include <bits/stdc++.h>
using namespace std;
int N;
int sol[200010], BIT[200010];
pair<int, int> a[200010];
void update(int p) {
  for (; p <= N; p += (p & -p)) BIT[p]++;
}
int get(int p) {
  int sum = 0;
  for (; p > 0; p -= p & -p) sum += BIT[p];
  return sum;
}
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) scanf("%d", &a[i].first), a[i].second = i + 1;
  sort(a, a + N);
  for (int i = 0; i < N; ++i) {
    int v = a[i].second;
    update(v);
    for (int k = 1; k < N && k * (v - 1) + 2 <= N; ++k) {
      sol[k] += get(min(N, k * v + 1)) - get(k * (v - 1) + 1);
    }
  }
  for (int k = 1; k < N; ++k) printf("%d ", sol[k]);
  return 0;
}
