#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
  int N, tmp1 = 0, tmp2 = 0;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  bool c1 = false;
  bool c2 = false;
  bool c3 = false;
  bool c4 = false;
  bool c5 = false;
  bool c6 = false;
  bool c7 = false;
  bool c8 = false;
  for (int i = 0; i < N; i++) {
    if (a[i] < 400) {
      if (c1 == false) {
        c1 = true;
        tmp1++;
      }
    } else if (a[i] < 800) {
      if (c2 == false) {
        c2 = true;
        tmp1++;
      }
    } else if (a[i] < 1200) {
      if (c3 == false) {
        c3 = true;
        tmp1++;
      }
    } else if (a[i] < 1600) {
      if (c4 == false) {
        c4 = true;
        tmp1++;
      }
    } else if (a[i] < 2000) {
      if (c5 == false) {
        c5 = true;
        tmp1++;
      }
    } else if (a[i] < 2400) {
      if (c6 == false) {
        c6 = true;
        tmp1++;
      }
    } else if (a[i] < 2800) {
      if (c7 == false) {
        c7 = true;
        tmp1++;
      }
    } else if (a[i] < 3200) {
      if (c8 == false) {
        c8 = true;
        tmp1++;
      }
    } else {
      tmp2++;
    }
  }
  if (tmp1 == 0) {
    cout << tmp2 << " " << tmp2 << endl;
  } else {
    cout << tmp1 << " " << tmp1 + tmp2 << endl;
  }
  return 0;
}
