#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int K = 450;
int a[N], ans[N];
vector<int> block[K];
int LessThanVal(int val, int id) {
  int l = -1, r = block[id].size();
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (block[id][m] >= val)
      r = m;
    else
      l = m;
  }
  return l + 1;
}
int Solve(int l, int r, int val) {
  int res = 0, lId = l / K, rId = r / K;
  if (lId == rId) {
    for (int i = l; i <= r; i++) res += a[i] < val;
  } else {
    for (int i = l; i <= (lId + 1) * K - 1; i++) res += a[i] < val;
    for (int i = lId + 1; i <= rId - 1; i++) res += LessThanVal(val, i);
    for (int i = rId * K; i <= r; i++) res += a[i] < val;
  }
  return res;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    block[i / K].push_back(a[i]);
  }
  for (int i = 0; i < K; i++) sort(block[i].begin(), block[i].end());
  for (int i = 0; i < n; i++)
    for (int k = 1; k * i + 1 < n && k < n; k++)
      ans[k] += Solve(k * i + 1, min(k * i + k, n - 1), a[i]);
  for (int k = 1; k <= n - 1; k++) cout << ans[k] << ' ';
  cout << endl;
  return 0;
}
