#include <bits/stdc++.h>
using namespace std;
const int MAXN = 222222;
int bit[MAXN], a[MAXN], ans[MAXN];
int bit_sum(int x) {
  int sum = 0;
  for (; x > 0; x -= x & (-x)) sum += bit[x];
  return sum;
}
void bit_add(int x, int z) {
  for (; x < MAXN; x += x & (-x)) bit[x] += z;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  int N;
  cin >> N;
  for (int i = 0; i < (int)(N); ++i) cin >> a[i];
  vector<pair<int, int> > w;
  for (int i = 0; i < (int)(N); ++i) w.push_back(make_pair(a[i], i + 1));
  sort((w).begin(), (w).end());
  for (pair<int, int> p : w) {
    int i = p.second;
    for (int k = 1; k * (i - 1) + 2 <= N && k < N; ++k) {
      ans[k] += bit_sum(min(k * i + 1, N)) - bit_sum(k * (i - 1) + 1);
    }
    bit_add(i, 1);
  }
  for (int k = 1; k <= (int)(N - 1); ++k) cout << ans[k] << " \n"[k == N - 1];
  return 0;
}
