#include <bits/stdc++.h>
using namespace std;
int ans[200010];
int a[200010];
int main() {
  int n, i, j;
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%d", &a[i]);
  memset(ans, 0, sizeof(ans));
  if (a[2] < a[1]) ans[1]++;
  for (i = 3; i <= n; ++i) {
    int val = i - 2;
    int lim = sqrt(val);
    for (j = lim; j >= 1; --j) {
      int val1 = val / j;
      if (a[i] < a[val1 + 1]) {
        ans[j]++;
        ans[j + 1]--;
      }
      if (j != val1) {
        if (a[i] < a[j + 1]) {
          int val2 = val / (j + 1);
          ans[val2 + 1]++;
          ans[val1 + 1]--;
        }
      }
    }
    if (a[i] < a[1]) ans[val + 1]++;
  }
  for (i = 2; i < n; ++i) ans[i] += ans[i - 1];
  for (i = 1; i < n; ++i) printf("%d ", ans[i]);
}
