import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

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

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.HashSet; HashSet java.util import java.util.Scanner; Scanner java.util import java.util.Set; Set java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) C solver = new C(); solver new C() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        }

    } C public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        } solve {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        } int n = Integer.parseInt(in.next()); n Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int a[] = new int[n]; a new int[n] n Set<Integer> cnt = new HashSet<>(); cnt new HashSet<>() int overred = 0; overred 0 for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            } {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            } a[i] = Integer.parseInt(in.next()) a[i] a i Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in if (a[i] <= 399) cnt.add(0); a[i] <= 399 a[i] a i 399 cnt.add(0) cnt.add cnt 0 if (400 <= a[i] && a[i] <= 799) cnt.add(1); 400 <= a[i] && a[i] <= 799 400 <= a[i] 400 a[i] a i a[i] <= 799 a[i] a i 799 cnt.add(1) cnt.add cnt 1 if (800 <= a[i] && a[i] <= 1199) cnt.add(2); 800 <= a[i] && a[i] <= 1199 800 <= a[i] 800 a[i] a i a[i] <= 1199 a[i] a i 1199 cnt.add(2) cnt.add cnt 2 if (1200 <= a[i] && a[i] <= 1599) cnt.add(3); 1200 <= a[i] && a[i] <= 1599 1200 <= a[i] 1200 a[i] a i a[i] <= 1599 a[i] a i 1599 cnt.add(3) cnt.add cnt 3 if (1600 <= a[i] && a[i] <= 1999) cnt.add(4); 1600 <= a[i] && a[i] <= 1999 1600 <= a[i] 1600 a[i] a i a[i] <= 1999 a[i] a i 1999 cnt.add(4) cnt.add cnt 4 if (2000 <= a[i] && a[i] <= 2399) cnt.add(5); 2000 <= a[i] && a[i] <= 2399 2000 <= a[i] 2000 a[i] a i a[i] <= 2399 a[i] a i 2399 cnt.add(5) cnt.add cnt 5 if (2400 <= a[i] && a[i] <= 2799) cnt.add(6); 2400 <= a[i] && a[i] <= 2799 2400 <= a[i] 2400 a[i] a i a[i] <= 2799 a[i] a i 2799 cnt.add(6) cnt.add cnt 6 if (2800 <= a[i] && a[i] <= 3199) cnt.add(7); 2800 <= a[i] && a[i] <= 3199 2800 <= a[i] 2800 a[i] a i a[i] <= 3199 a[i] a i 3199 cnt.add(7) cnt.add cnt 7 if (3200 <= a[i]) overred++; 3200 <= a[i] 3200 a[i] a i overred++ overred int ansmx = cnt.size() + overred; ansmx cnt.size() + overred cnt.size() cnt.size cnt overred int ansmn = cnt.size(); ansmn cnt.size() cnt.size cnt if (cnt.size() == 0) ansmn = 1; cnt.size() == 0 cnt.size() cnt.size cnt 0 ansmn = 1 ansmn 1 out.println(ansmn + " " + ansmx) out.println out ansmn + " " + ansmx ansmn + " " + ansmx ansmn " " ansmx int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        C solver = new C();
        solver.solve(1, in, out);
        out.close();
    }

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

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

    static class C {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int a[] = new int[n];
            Set<Integer> cnt = new HashSet<>();
            int overred = 0;
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(in.next());
                if (a[i] <= 399) cnt.add(0);
                if (400 <= a[i] && a[i] <= 799) cnt.add(1);
                if (800 <= a[i] && a[i] <= 1199) cnt.add(2);
                if (1200 <= a[i] && a[i] <= 1599) cnt.add(3);
                if (1600 <= a[i] && a[i] <= 1999) cnt.add(4);
                if (2000 <= a[i] && a[i] <= 2399) cnt.add(5);
                if (2400 <= a[i] && a[i] <= 2799) cnt.add(6);
                if (2800 <= a[i] && a[i] <= 3199) cnt.add(7);
                if (3200 <= a[i]) overred++;
            }
            int ansmx = cnt.size() + overred;
            int ansmn = cnt.size();
            if (cnt.size() == 0) ansmn = 1;

            // 出力
            out.println(ansmn + " " + ansmx);

        }

    }
}

