#include <bits/stdc++.h>
using namespace std;
const int N = 200000 + 10;
int n;
int a[N];
int cnt[N];
void solve() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    if (i == 1) continue;
    int curK = 1;
    for (;;) {
      int value = (i - 2) / curK;
      if (value == 0) {
        if (a[1] > a[i]) {
          cnt[curK]++;
        }
        break;
      }
      int nextK = (i - 2) / value;
      if (a[value + 1] > a[i]) {
        cnt[curK]++;
        cnt[nextK + 1]--;
      }
      curK = nextK + 1;
    }
  }
  for (int i = 1; i < n; ++i) {
    cnt[i] += cnt[i - 1];
    cout << cnt[i] << ' ';
  }
  cout << endl;
}
int main() {
  solve();
  return 0;
}
