import java.util.HashSet;
import java.util.Scanner;

public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        }
    }
} import java.util.HashSet; HashSet java.util import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        }
    }
} Main public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        }
    } main {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        }
    } try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        } {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        } Scanner in = new Scanner(System.in) Scanner in = new Scanner(System.in) new Scanner(System.in) int N = in.nextInt(); N in.nextInt() in.nextInt in int[] a = new int[N]; a new int[N] N for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                a[i] = in.nextInt();
            } {
                a[i] = in.nextInt();
            } a[i] = in.nextInt() a[i] a i in.nextInt() in.nextInt in for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            } {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            } if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 399 a[i] a i 399 {
                    a[i] = 1;
                } a[i] = 1 a[i] a i 1 if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 799 a[i] a i 799 {
                    a[i] = 2;
                } a[i] = 2 a[i] a i 2 if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 1199 a[i] a i 1199 {
                    a[i] = 3;
                } a[i] = 3 a[i] a i 3 if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 1599 a[i] a i 1599 {
                    a[i] = 4;
                } a[i] = 4 a[i] a i 4 if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 1999 a[i] a i 1999 {
                    a[i] = 5;
                } a[i] = 5 a[i] a i 5 if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 2399 a[i] a i 2399 {
                    a[i] = 6;
                } a[i] = 6 a[i] a i 6 if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 2799 a[i] a i 2799 {
                    a[i] = 7;
                } a[i] = 7 a[i] a i 7 if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                } a[i] <= 3199 a[i] a i 3199 {
                    a[i] = 8;
                } a[i] = 8 a[i] a i 8 {
                    a[i] = 0;
                } a[i] = 0 a[i] a i 0 HashSet<Integer> colors = new HashSet<>(); colors new HashSet<>() int count0s = 0; count0s 0 for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            } {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            } if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                } a[i] > 0 a[i] a i 0 {
                    colors.add(a[i]);
                } colors.add(a[i]) colors.add colors a[i] a i {
                    count0s++;
                } count0s++ count0s int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0; min colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0 colors.size() > 0 colors.size() colors.size colors 0 colors.size() colors.size colors count0s > 0 ? 1 : 0 count0s > 0 count0s 0 1 0 int max = colors.size() + count0s; max colors.size() + count0s colors.size() colors.size colors count0s System.out.println(min + " " + max) System.out.println System.out System System.out min + " " + max min + " " + max min " " max String args[] args public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        }
    }
} public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        }
    }
} Main
import java.util.HashSet;
import java.util.Scanner;

public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int[] a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = in.nextInt();
            }

            for (int i = 0; i < N; i++) {
                if (a[i] <= 399) {
                    a[i] = 1;
                } else if (a[i] <= 799) {
                    a[i] = 2;
                } else if (a[i] <= 1199) {
                    a[i] = 3;
                } else if (a[i] <= 1599) {
                    a[i] = 4;
                } else if (a[i] <= 1999) {
                    a[i] = 5;
                } else if (a[i] <= 2399) {
                    a[i] = 6;
                } else if (a[i] <= 2799) {
                    a[i] = 7;
                } else if (a[i] <= 3199) {
                    a[i] = 8;
                } else {
                    a[i] = 0;
                }
            }

            HashSet<Integer> colors = new HashSet<>();
            int count0s = 0;
            for (int i = 0; i < N; i++) {
                if (a[i] > 0) {
                    colors.add(a[i]);
                } else {
                    count0s++;
                }
            }

            int min = colors.size() > 0 ? colors.size() : count0s > 0 ? 1 : 0;
            int max = colors.size() + count0s;
            System.out.println(min + " " + max);
        }
    }
}
