let scan_int () = Scanf.scanf " %d" (fun x -> x)
let scan_array len read_func = Array.init len (fun _ -> read_func())
let print_int n = Printf.printf "%d\n" n

let input n =
  let arr = Array.make n 0 in
  let _ =
    for i = 0 to n-1 do
      let a = scan_int() in
      arr.(a-1) <- arr.(a-1) + 1
    done in
  arr

let cumulative_sum n arr =
  let ret = Array.make (n+1) 0 in
  let _ =
    for i = 0 to n-1 do
      ret.(i+1) <- ret.(i) + arr.(i)
    done in
  ret

let rec binary_search left right eval =
  if right - left <= 1 then right
  else 
    let mid = (right + left) / 2 in
    if eval mid then binary_search mid right eval
    else binary_search left mid eval

let inner_eval arr value mid = arr.(mid) > value

let eval i arr cum remain mid =
  let r = binary_search (-1) i (inner_eval arr mid) in
  let require = (i-r) * mid - (cum.(i) - cum.(r)) in
  remain >= require

let solve i n arr cum =
  let remain = n - cum.(i) in
  (binary_search 0 (n+1) (eval i arr cum remain)) - 1  (* get left *)


let () =
  let n = scan_int() in
  let arr = input n in
  let _ = Array.fast_sort (fun x y -> if x < y then 1 else 0) arr in
  let cum = cumulative_sum n arr in
  for i = 1 to n do
    print_int (solve i n arr cum)
  done
  