#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 2;
int num[N], n, res[N], a[N];
void ReadData() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> num[i];
}
void Update(int x, int y) {
  if (x > y) return;
  ++a[x];
  --a[y + 1];
}
void Solve() {
  for (int i = 0; i < n; ++i) {
    int k = 1;
    for (; k * k <= (i - 1); ++k)
      if (num[i] < num[(i - 1) / k]) ++res[k];
    for (int j = 0; j <= (i - 1) / k; ++j)
      if (num[i] < num[j]) {
        if (0 == j)
          Update(i, n - 1);
        else
          Update(max(k, (i - 1) / (j + 1) + 1), (i - 1) / j);
      }
  }
  for (int i = 1; i < n; ++i) {
    a[i] += a[i - 1];
    res[i] += a[i];
  }
}
void Output() {
  for (int i = 1; i < n; ++i) cout << res[i] << endl;
}
int main() {
  ReadData();
  Solve();
  Output();
  return 0;
}
