#include <bits/stdc++.h>   using namespace std;   const int Maxn = 200020;   int n, a[Maxn];   long long sum[Maxn];   int main() {     scanf( %d , &n);     for (int i = 1; i <= n; i++) scanf( %d , a + i);     for (int i = 0; i < n - 1; i++) {       int cur;       for (cur = 1; cur <= i;) {         int val = i / cur;         int ncur = i / val + 1;         if (a[i + 2] < a[val + 1]) {           sum[cur]++;           sum[ncur]--;         }         cur = ncur;       }       if (a[i + 2] < a[1]) sum[cur]++, sum[n]--;     }     for (int i = 1; i < n; i++) sum[i] += sum[i - 1], printf( %I64d n , sum[i]);     ;   }   