#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  map<int, int> ns;
  int a;
  int over8 = 0;
  for (int i = 0; i < N; ++i) {
    cin >> a;
    auto idx = min(a / 400, 8);
    if (idx < 8) {
      ns[idx]++;
    } else {
      over8++;
    }
  }
  auto minv = ns.size();
  auto maxv = min((int)ns.size() + over8, 8);
  cout << minv << " " << maxv << endl;
  return 0;
}
