#include <bits/stdc++.h>
using namespace std;
long long int isPrime(int n) {
  if (n <= 1) return 1;
  if (n <= 3) return 2;
  if (n % 2 == 0 || n % 3 == 0) return 1;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return 1;
  return 2;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    long long int n, k = 0;
    cin >> n;
    long long int A[n], B[9] = {0};
    for (long long int i = 0; i < n; i++) {
      cin >> A[i];
      if (A[i] >= 1 && A[i] <= 399) {
        B[0]++;
      }
      if (A[i] >= 400 && A[i] <= 799) {
        B[1]++;
      }
      if (A[i] >= 800 && A[i] <= 1199) {
        B[2]++;
      }
      if (A[i] >= 1200 && A[i] <= 1599) {
        B[3]++;
      }
      if (A[i] >= 1600 && A[i] <= 1999) {
        B[4]++;
      }
      if (A[i] >= 2000 && A[i] <= 2399) {
        B[5]++;
      }
      if (A[i] >= 2400 && A[i] <= 2799) {
        B[6]++;
      }
      if (A[i] >= 2800 && A[i] <= 3199) {
        B[7]++;
      }
      if (A[i] >= 3200) {
        B[8]++;
      }
    }
    for (long long int i = 0; i < 8; i++) {
      if (B[i] > 0) k++;
    }
    cout << k << " " << k + B[8];
  }
  return 0;
}
