Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.

Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.

Input

The first line contains an integer N (1 ≤ N ≤ 1000) — the number of bars at Vasya’s disposal. The second line contains N space-separated integers li — the lengths of the bars. All the lengths are natural numbers not exceeding 1000.

Output

In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars.

Examples

Input

3
1 2 3


Output

1 3


Input

4
6 5 6 7


Output

2 3
import java.io.*;
import java.util.HashMap;
import java.util.Scanner;

/**
 * <ahref="http://codeforces.ru/problemset/problem/37/A"/>
 *
 * @author pvasilyev
 * @since 06 Dec 2013
 */
public class Problem043 {

    public static final String FILE_IN = "std.in";
    public static final String FILE_OUT = "std.out";
    private static boolean debugMode = true;

    public static void main(String[] args) throws IOException {

        final Scanner reader = new Scanner(new InputStreamReader(debugMode ? System.in : new FileInputStream(FILE_IN)));
        final PrintWriter writer = new PrintWriter(debugMode ? System.out : new FileOutputStream(FILE_OUT));

        solveTheProblem(reader, writer);

        reader.close();
        writer.close();
    }

    private static void solveTheProblem(final Scanner reader, final PrintWriter writer) {
        final int n = reader.nextInt();
        final HashMap<Integer, Integer> map = new HashMap<>();

        int max = 0;
        for (int i = 0; i < n; i++) {
            final int nextHeight = reader.nextInt();
            if (map.containsKey(nextHeight)) {
                map.put(nextHeight, map.get(nextHeight) + 1);
            } else {
                map.put(nextHeight, 1);
            }
            max = Math.max(max, map.get(nextHeight));
        }

        writer.println(max + " " + map.size());
    }

}
