#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
ll GCD(ll c, ll d) {
  if (c < d) swap(c, d);
  if (c % d == 0)
    return d;
  else {
    return GCD(c % d, d);
  }
}
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < (int)(n); i++) {
    cin >> v.at(i);
    v.at(i) /= 400;
  }
  set<int> s;
  int c = 0;
  for (int i = 0; i < (int)(n); i++) {
    if (v.at(i) >= 8) {
      c++;
    } else {
      s.insert(v.at(i));
    }
  }
  int count = s.size();
  cout << max(c, count) << " " << count + c;
}
