#include <bits/stdc++.h>
using namespace std;
void ABC064C() {
  int N;
  cin >> N;
  vector<int> val(N);
  for (auto& x : val) cin >> x;
  sort(val.begin(), val.end());
  vector<int> rank = {1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
  int M = rank.size();
  vector<int> dist(M);
  for (int i = 0; i < M; ++i) {
    dist[i] =
        distance(val.begin(), lower_bound(val.begin(), val.end(), rank[i]));
  }
  vector<int> ct(M + 1);
  adjacent_difference(dist.begin(), dist.end(), ct.begin());
  ct.back() = val.size() - dist.back();
  int minCt = 0;
  for (int i = 1; i < M; ++i) {
    minCt += ct[i] > 0 ? 1 : 0;
  }
  int maxCt = minCt + ct.back();
  cout << minCt << ' ' << maxCt << endl;
}
int main() {
  ABC064C();
  return 0;
}
