#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, cnt = 0;
  cin >> n;
  unordered_set<int> counter;
  for (int(i) = 0; (i) < (n); (i)++) {
    int a;
    cin >> a;
    a /= 400;
    if (a >= 8)
      cnt++;
    else
      counter.insert(a);
  }
  cout << counter.size() << " " << min((int)counter.size() + cnt, 8) << endl;
}
