Given one line of N consecutive natural numbers starts from 0 called A[N], and the target is to give another line of N numbers called B[N], and B[i] is the times that A[i] appears in B[N].
For example, when N=10.the first line of number is:
A: 0 1 2 3 4 5 6 7 8 9
Then, as the description above, the second line of numbers should be:
B: 6 2 1 0 0 0 1 0 0 0
Which B[0]=6 means, A[0] appears 6 times in B,
B[1]=2 means, A[1] appears 2 times in the second line, ... , and so on.
Your task is to give the second line of number B, for each given A.

The input contains nulti cases, each case consists only one number N (7<N<1000)

For each test case, output the n numbers in B.

10

6 2 1 0 0 0 1 0 0 0

零基础的同学可以先学习基础，教程见:  C语言教程、C++教程、编译器教程、数据结构教程、Python教程、单片机教程等

视频教学见视频网课