
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int[] a = new int[N];
		int[] list = new int[9];
		int min = 0;
		int max = 0;
		for(int i = 0; i < list.length; i++) {
			list[i] = 0;
		}
		for(int i = 0; i < N; i++) {
			a[i] = scan.nextInt();
			if(a[i] <= 399 && a[i] >= 1) {
				list[0]++;
			} else if(a[i] <= 799 && a[i] >= 400) {
				list[1]++;
			} else if(a[i] <= 1199 && a[i] >= 800) {
				list[2]++;
			} else if(a[i] <= 1599 && a[i] >= 1200) {
				list[3]++;
			} else if(a[i] <= 1999 && a[i] >= 1600) {
				list[4]++;
			} else if(a[i] <= 2399 && a[i] >= 2000) {
				list[5]++;
			} else if(a[i] <= 2799 && a[i] >= 2400) {
				list[6]++;
			} else if(a[i] <= 3199 && a[i] >= 2800) {
				list[7]++;
			} else if(a[i] >= 3200) {
				list[8]++;
			}
		}
		for(int i = 0; i < list.length - 1; i++) {
			if(list[i] > 0) {
				min++;
			}
		}
		max = min + list[8];
		if(min == 0 && list[8] >= 1) {
			min = 1;
		}
		System.out.println(min + " " + max);
		scan.close();

	}

}

/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