#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
  int N;
  cin >> N;
  vector<int> as(N);
  for (int i = 0; i < (N); ++i) cin >> as[i];
  map<int, int> m;
  int free = 0;
  for (int i = 0; i < (N); ++i) {
    int a = as[i];
    if (3200 <= a) {
      free++;
      continue;
    }
    m[a / 400]++;
  }
  int mSize = m.size();
  int mi = max(mSize, 1);
  int ma = mi + free;
  cout << mi << " " << ma << endl;
  return 0;
}
