#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n;
int arr[MAXN];
int pm[2][MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &arr[i]);
  }
  long long ans = 0;
  int rg = min((int)sqrt(n), n - 1);
  for (int i = 1; i < n; ++i) {
    for (int j = 1; j <= rg; ++j) {
      if (arr[i] < arr[(i - 1) / j]) {
        pm[0][j] += 1;
        pm[1][j] += 1;
      }
    }
  }
  for (int i = 0; i * (rg + 1) + 1 < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      if (arr[j] >= arr[i]) {
        continue;
      }
      int l = j / (i + 1);
      if (l * (i + 1) < j) {
        ++l;
      }
      int r = 0;
      if (i == 0) {
        r = n - 1;
      } else {
        r = j / i;
        if (r * i >= j) {
          --r;
        }
      }
      l = max(l, rg + 1);
      if (l <= r) {
        pm[0][l] += 1;
        pm[1][r] += 1;
      }
    }
  }
  int bal = 0;
  for (int i = 1; i <= n - 1; ++i) {
    bal += pm[0][i];
    cout << bal << " ";
    bal -= pm[1][i];
  }
  cout << endl;
  return 0;
}
