import java.util.Arrays;
import java.util.Scanner;

public class Main {

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

	public void execute() {
		Scanner sc = new Scanner(System.in);
		final int N = sc.nextInt();

		int[] rate = new int[N];
		int over = 0;
		int minColors = 0;
		int maxColors = 0;

		boolean[] c = new boolean[8];
		
		for (int i = 0; i < N; i++) {
			rate[i] = sc.nextInt();
			if(rate[i]>=3200) {
				over++;
			}
			else {
				c[(int)(rate[i]/400)] = true;
			}
		}

		for (boolean b: c) {
			if (b) {
				minColors++;
			}
		}
		
		maxColors = minColors + over;
		System.out.printf("%d %d\n", Math.max(minColors, 1), maxColors);
		sc.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