import java.util.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] a = new int[N];

        for (int i= 0; i < N; i++) {
            a[i] = sc.nextInt();
        }

        int[] pop = new int[9];
        for (int i = 0; i < N; i++) {
            pop[Math.min(a[i]/400, 8)]++;
        }

        int cnt1 = 0;
        for (int i = 0; i < 8; i++) {
            if (pop[i] > 0) cnt1++;
        }

        if (cnt1 == 0 && pop[8] > 0) {
            cnt1 = 1;
            pop[8]--;
        }

        int cnt2 = cnt1 + pop[8];
        System.out.println(cnt1 + " " + cnt2);

        return;
    }

} import java.util.*; util.* java class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
} Main public static void main(String[] args) {
        new Solver().run();
    } main {
        new Solver().run();
    } new Solver().run() new Solver().run new Solver() String[] args args class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] a = new int[N];

        for (int i= 0; i < N; i++) {
            a[i] = sc.nextInt();
        }

        int[] pop = new int[9];
        for (int i = 0; i < N; i++) {
            pop[Math.min(a[i]/400, 8)]++;
        }

        int cnt1 = 0;
        for (int i = 0; i < 8; i++) {
            if (pop[i] > 0) cnt1++;
        }

        if (cnt1 == 0 && pop[8] > 0) {
            cnt1 = 1;
            pop[8]--;
        }

        int cnt2 = cnt1 + pop[8];
        System.out.println(cnt1 + " " + cnt2);

        return;
    }

} Solver public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] a = new int[N];

        for (int i= 0; i < N; i++) {
            a[i] = sc.nextInt();
        }

        int[] pop = new int[9];
        for (int i = 0; i < N; i++) {
            pop[Math.min(a[i]/400, 8)]++;
        }

        int cnt1 = 0;
        for (int i = 0; i < 8; i++) {
            if (pop[i] > 0) cnt1++;
        }

        if (cnt1 == 0 && pop[8] > 0) {
            cnt1 = 1;
            pop[8]--;
        }

        int cnt2 = cnt1 + pop[8];
        System.out.println(cnt1 + " " + cnt2);

        return;
    } run {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] a = new int[N];

        for (int i= 0; i < N; i++) {
            a[i] = sc.nextInt();
        }

        int[] pop = new int[9];
        for (int i = 0; i < N; i++) {
            pop[Math.min(a[i]/400, 8)]++;
        }

        int cnt1 = 0;
        for (int i = 0; i < 8; i++) {
            if (pop[i] > 0) cnt1++;
        }

        if (cnt1 == 0 && pop[8] > 0) {
            cnt1 = 1;
            pop[8]--;
        }

        int cnt2 = cnt1 + pop[8];
        System.out.println(cnt1 + " " + cnt2);

        return;
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] a = new int[N]; a new int[N] N for (int i= 0; i < N; i++) {
            a[i] = sc.nextInt();
        } int i= 0; int i= 0; i 0 i < N i N i++ i++ i {
            a[i] = sc.nextInt();
        } {
            a[i] = sc.nextInt();
        } a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc int[] pop = new int[9]; pop new int[9] 9 for (int i = 0; i < N; i++) {
            pop[Math.min(a[i]/400, 8)]++;
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            pop[Math.min(a[i]/400, 8)]++;
        } {
            pop[Math.min(a[i]/400, 8)]++;
        } pop[Math.min(a[i]/400, 8)]++ pop[Math.min(a[i]/400, 8)] pop Math.min(a[i]/400, 8) Math.min Math a[i]/400 a[i] a i 400 8 int cnt1 = 0; cnt1 0 for (int i = 0; i < 8; i++) {
            if (pop[i] > 0) cnt1++;
        } int i = 0; int i = 0; i 0 i < 8 i 8 i++ i++ i {
            if (pop[i] > 0) cnt1++;
        } {
            if (pop[i] > 0) cnt1++;
        } if (pop[i] > 0) cnt1++; pop[i] > 0 pop[i] pop i 0 cnt1++ cnt1 if (cnt1 == 0 && pop[8] > 0) {
            cnt1 = 1;
            pop[8]--;
        } cnt1 == 0 && pop[8] > 0 cnt1 == 0 cnt1 0 pop[8] > 0 pop[8] pop 8 0 {
            cnt1 = 1;
            pop[8]--;
        } cnt1 = 1 cnt1 1 pop[8]-- pop[8] pop 8 int cnt2 = cnt1 + pop[8]; cnt2 cnt1 + pop[8] cnt1 pop[8] pop 8 System.out.println(cnt1 + " " + cnt2) System.out.println System.out System System.out cnt1 + " " + cnt2 cnt1 + " " + cnt2 cnt1 " " cnt2 return;
import java.util.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] a = new int[N];

        for (int i= 0; i < N; i++) {
            a[i] = sc.nextInt();
        }

        int[] pop = new int[9];
        for (int i = 0; i < N; i++) {
            pop[Math.min(a[i]/400, 8)]++;
        }

        int cnt1 = 0;
        for (int i = 0; i < 8; i++) {
            if (pop[i] > 0) cnt1++;
        }

        if (cnt1 == 0 && pop[8] > 0) {
            cnt1 = 1;
            pop[8]--;
        }

        int cnt2 = cnt1 + pop[8];
        System.out.println(cnt1 + " " + cnt2);

        return;
    }

}