#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
  int N;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int hai = 0, cha = 0, midori = 0, mizu = 0, ao = 0, ki = 0, orange = 0,
      aka = 0, ran = 0;
  for (int i = 0; i < N; i++) {
    if (a[i] < 400) {
      hai++;
    } else if (a[i] < 800) {
      cha = 1;
    } else if (a[i] < 1200) {
      midori = 1;
    } else if (a[i] < 1600) {
      mizu = 1;
    } else if (a[i] < 2000) {
      ao = 1;
    } else if (a[i] < 2400) {
      ki = 1;
    } else if (a[i] < 2800) {
      orange = 1;
    } else if (a[i] < 3200) {
      aka = 1;
    } else {
      ran++;
    }
  }
  int min, max;
  max = hai + cha + midori + mizu + ao + ki + orange + aka + ran;
  if (hai + cha + midori + mizu + ao + ki + orange + aka == 0) {
    min = 1;
  } else {
    min = hai + cha + midori + mizu + ao + ki + orange + aka;
  }
  cout << min << ' ' << max;
}
