import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int ns[] = new int[n];
        for (int i = 0; i < n; i++) {
            ns[i] = sc.nextInt();
        }
        int counts[] = new int[9];
        for (int i = 0; i < n; i++) {
            int cr = ns[i] / 400;
            cr = cr > 8 ? 8 : cr;
            counts[cr]++;
        }
        int min = 0, max = 0;
        for (int i = 0; i < 8; i++) {
            if (counts[i] != 0) {
                min++;
            }
        }
        max = min + counts[counts.length-1];
        min = min == 0 ? 1 : min;
        System.out.println(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