{"raw_statement":[{"iden":"problem statement","content":"Takahashi has $N$ cards. The $i$\\-th of these cards has an integer $A_i$ written on it.\nTakahashi will choose an integer $K$, and then repeat the following operation some number of times:\n\n*   Choose exactly $K$ cards such that the integers written on them are all different, and eat those cards. (The eaten cards disappear.)\n\nFor each $K = 1,2, \\ldots, N$, find the maximum number of times Takahashi can do the operation."},{"iden":"constraints","content":"*   $1 \\le N \\le 3 \\times 10^5$\n*   $1 \\le A_i \\le N$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3\n2 1 2"},{"iden":"sample output 1","content":"3\n1\n0\n\nFor $K = 1$, we can do the operation as follows:\n\n*   Choose the first card to eat.\n*   Choose the second card to eat.\n*   Choose the third card to eat.\n\nFor $K = 2$, we can do the operation as follows:\n\n*   Choose the first and second cards to eat.\n\nFor $K = 3$, we cannot do the operation at all. Note that we cannot choose the first and third cards at the same time."},{"iden":"sample input 2","content":"5\n1 2 3 4 5"},{"iden":"sample output 2","content":"5\n2\n1\n1\n1"},{"iden":"sample input 3","content":"4\n1 3 3 3"},{"iden":"sample output 3","content":"4\n1\n0\n0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}