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

public class Main {
  public static void main (String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] color = new int[8];
    int min =0, max =0, expert =0;
    for (int i =0; i<N; i++) {
      int x = sc.nextInt();
      if (x >= 3200) {
        expert++;
      } else if (x >= 2800) {
        color[7]++;
      } else if (x >= 2400) {
        color[6]++;
      } else if (x >= 2000) {
        color[5]++;
      } else if (x >= 1600) {
        color[4]++;
      } else if (x >= 1200) {
        color[3]++;
      } else if (x >= 800) {
        color[2]++;
      } else if (x >= 400) {
        color[1]++;
      } else {
        color[0]++;
      }
    }
    for (int i =0; i<8; i++) {
      if (color[i] != 0) min++;
    }
    max = min + expert;
    min = Math.max(min, 1);
    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