#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
pair<int, int> a[N];
int n, ans[N];
int seg[4 * N];
void fetch(int ind, int l = 0, int r = n, int v = 1) {
  seg[v]++;
  if (r - l == 1) return;
  if (ind < (l + r) / 2)
    fetch(ind, l, (l + r) / 2, 2 * v);
  else
    fetch(ind, (l + r) / 2, r, 2 * v + 1);
}
int query(int lb, int ub, int l = 0, int r = n, int v = 1) {
  if (lb <= l && ub >= r) return seg[v];
  if (lb >= r || ub <= l) return 0;
  return query(lb, ub, l, (l + r) / 2, 2 * v) +
         query(lb, ub, (l + r) / 2, r, 2 * v + 1);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    int ind = a[i].second;
    for (int k = 1; ind * k + 1 < n && k < n; k++)
      ans[k] += query(ind * k + 1, min(ind * k + 1 + k, n));
    fetch(ind);
  }
  for (int i = 1; i < n; i++) cout << ans[i] << " ";
  cout << "\n";
  return 0;
}
