import java.util.Scanner;

public class Main {

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

    void compute() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int counst = 0;
        boolean[] exists = new boolean[8];
        for (int i = 0; i < N; i++) {
            int a = sc.nextInt();
            if (a < 3200) {
                exists[a / 400] = true;
            } else {
                counst++;
            }
        }
        int nkinds = 0;
        for (int i = 0; i < 8; i++) {
            if (exists[i]) {
                nkinds++;
            }
        }
        if (counst != 0) {
            System.out.println(Math.max(1, nkinds) + " " + (nkinds + counst));
        } else {
            System.out.println(nkinds + " " + nkinds);
        }
    }
}

/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