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.*;

public class Main {
    static InputReader in = new InputReader(System.in);
    static PrintWriter out = new PrintWriter(System.out);

    public static void main(String[] args) {
        new Solution().solve();
        out.close();
    }

    static class Solution {
        void solve() {
            int n = in.nextInt();
            TreeMap<Integer, Integer> map = new TreeMap<>();
            for (int i = 0; i < n; i++) {
                int l = in.nextInt();
                if (map.get(l) == null) {
                    map.put(l, 1);
                }
                else {
                    int count = map.get(l);
                    map.remove(l);
                    map.put(l, count + 1);
                }
            }
            int maxHeight = 0;
            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
                maxHeight = Math.max(maxHeight, entry.getValue());
            }
            out.printf("%d %d\n", maxHeight, map.size());
        }
    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream inStream) {
            this.reader = new BufferedReader(new InputStreamReader(inStream));
            this.tokenizer = null;
        }

        /**
         * @return String the whole line (including all whitespaces)
         *         or null line is empty
         */
        String nextLine() {
            this.tokenizer = null;
            String line = null;
            try {
                line = this.reader.readLine();
            }
            catch (Exception e) {
                e.printStackTrace();
            }
            return line;
        }

        /**
         * @return String next token, or null if the current line is empty
         */
        String next() {
            while (this.tokenizer == null || !this.tokenizer.hasMoreTokens()) {
                String line = nextLine();
                if (line == null) return null;
                this.tokenizer = new StringTokenizer(line);
            }
            return this.tokenizer.nextToken();
        }

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

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        char nextChar() {
            return next().charAt(0);
        }
    }
}
