import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		int[] cnt = new int[9];
		for(int i = 0 ; i < n ; i++) {
			a[i] = sc.nextInt();
			if(1 <= a[i] && a[i] <= 399) cnt[0]++;
			else if(400 <= a[i] && a[i] <= 799) cnt[1]++;
			else if(800 <= a[i] && a[i] <= 1199) cnt[2]++;
			else if(1200 <= a[i] && a[i] <= 1599) cnt[3]++;
			else if(1600 <= a[i] && a[i] <= 1999) cnt[4]++;
			else if(2000 <= a[i] && a[i] <= 2399) cnt[5]++;
			else if(2400 <= a[i] && a[i] <= 2799) cnt[6]++;
			else if(2800 <= a[i] && a[i] <= 3199) cnt[7]++;
			else cnt[8]++;
		}
		int min = 0;
		int max = 0;
		for(int i = 0 ; i < 8 ; i++) {
			if(cnt[i] >= 1) min++;
		}
		min = Math.max(1, min);
		if(n == cnt[8]) max = cnt[8];
		else max = min + cnt[8];
		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