output_description: Print N integers. The t-th (1 \le t \le N) of them should be the answer for
  the case K=t.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 \ldots A_N
attempt: n = int(input())
  l = list(map(int, input().split()))
  l.sort()
  while (l[-1] > l[-2] + l[-3]) and (len(l) > 3):
      del l[-1]
  n = len(l)
  ans = 0
  i = 0
  while i < n - 2:
      j = i + 1
      while j < n - 1:
          k = j + 1
          while k < n:
              if l[k] < l[i] + l[j]:
                  ans = ans + 1
              else:
                  k = n
              k = k + 1
          j = j + 1
      i = i + 1
  print(ans)
  
problem_description: Statement
  
  Takahashi has N cards. The i-th of these cards has an integer A_i written on
  it.
  
  Takahashi will choose an integer K, and then repeat the following operation
  some number of times:
  
    * Choose exactly K cards such that the integers written on them are all different, and eat those cards. (The eaten cards disappear.)
  
  For each K = 1,2, \ldots, N, find the maximum number of times Takahashi can do
  the operation.
samples: [{"input": "3\n    2 1 2", "output": "3\n    1\n    0\n    \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\nfirst and third cards at the same time.\n\n* * *"}, {"input": "5\n    1 2 3 4 5", "output": "5\n    2\n    1\n    1\n    1\n    \n\n* * *"}, {"input": "4\n    1 3 3 3", "output": "4\n    1\n    0\n    0"}]