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.

Constraints

* 1 \le N \le 3 \times 10^5
* 1 \le A_i \le N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 \ldots A_N


Output

Print N integers. The t-th (1 \le t \le N) of them should be the answer for the case K=t.

Examples

Input

3
2 1 2


Output

3
1
0


Input

5
1 2 3 4 5


Output

5
2
1
1
1


Input

4
1 3 3 3


Output

4
1
0
0
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.function.Function;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author anand.oza
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        FDistinctNumbers solver = new FDistinctNumbers();
        solver.solve(1, in, out);
        out.close();
    }

    static class FDistinctNumbers {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = in.readIntArray(n);
            Integer[] count = new Integer[n];
            Arrays.fill(count, 0);

            for (int x : a) {
                count[x - 1]++;
            }

            Arrays.sort(count, Comparator.reverseOrder());

            int[] remain = new int[n];
            remain[0] = n - count[0];
            for (int i = 1; i < n; i++) {
                remain[i] = remain[i - 1] - count[i];
            }

            out.println(n); // k=1
            for (int kLoop = 2; kLoop <= n; kLoop++) {
                int k = kLoop;
                int bound = n / k;
                int index = BinarySearch.binarySearch((i) -> {
                    if (k - 1 - i <= 0)
                        return true;
                    if (i <= 0)
                        return false;

                    double boundCur = ((double) remain[i]) / (k - 1 - i);
                    double boundPrev = ((double) remain[i - 1]) / (k - 1 - (i - 1));
                    return boundPrev < boundCur;
                });

                index--;
                bound = Math.min(bound, remain[index] / (k - 1 - index));
                out.println(bound);
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public int[] readIntArray(int n) {
            int[] x = new int[n];
            for (int i = 0; i < n; i++) {
                x[i] = nextInt();
            }
            return x;
        }

    }

    static class BinarySearch {
        public static int binarySearch(Function<Integer, Boolean> bigEnough) {
            int tooSmall = 0, tooBig;
            if (bigEnough.apply(tooSmall)) {
                return tooSmall;
            }

            for (tooBig = 1; !bigEnough.apply(tooBig); tooBig *= 2)
                ;

            if (!bigEnough.apply(tooBig - 1)) {
                return tooBig;
            }

            while (tooBig - tooSmall > 1) {
                int center = tooSmall + (tooBig - tooSmall) / 2;
                if (!bigEnough.apply(center)) {
                    tooSmall = center;
                } else {
                    tooBig = center;
                }
            }

            return tooBig;
        }

    }
}

