import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        Map<Integer, Integer> m = new HashMap<>();
        for (int i = 0; i < 9; i++) {
            m.put(i, 0);
        }
        for (int i = 0; i < n; i++) {
            int a = s.nextInt();
            int t = a / 400;
            if (t >= 9) {
                t = 8;
            }
            m.put(t, m.get(t) + 1);
        }
        int min = 0;
        for (int i = 0; i < 8; i++) {
            if (m.get(i) != 0) {
                min++;
            }
        }
        int max = min + m.get(8);
        if (min == 0 && m.get(8) != 0) {
            min = 1;
        }
        System.out.printf("%s %s", min, max);
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz