#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  unordered_set<int> s;
  int fn = 0;
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    if (1 <= a && a <= 399) {
      s.insert(1);
    } else if (400 <= a && a <= 799) {
      s.insert(2);
    } else if (800 <= a && a <= 1199) {
      s.insert(3);
    } else if (1200 <= a && a <= 1599) {
      s.insert(4);
    } else if (1600 <= a && a <= 1999) {
      s.insert(5);
    } else if (2000 <= a && a <= 2399) {
      s.insert(6);
    } else if (2400 <= a && a <= 2799) {
      s.insert(7);
    } else if (2800 <= a && a <= 3199) {
      s.insert(8);
    } else if (a >= 3200) {
      fn++;
    }
  }
  if (s.size() != 0)
    cout << s.size() << " " << s.size() + fn << endl;
  else
    cout << s.size() + fn << " " << s.size() + fn << endl;
}
