#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
  int n;
  cin >> n;
  vector<int> A(n);
  map<int, int> cnt;
  for (int i = 0; i < (int)(n); i++) {
    cin >> A[i];
  }
  for (int i = 0; i < (int)(n); i++) {
    if (A[i] >= 3200) {
      cnt[3200]++;
    } else {
      for (int x = 0; x <= 2800; x += 400) {
        if (x <= A[i] && A[i] < x + 400) {
          cnt[x]++;
          break;
        }
      }
    }
  }
  int minv, maxv;
  minv = cnt.size();
  maxv = minv;
  if (cnt.count(3200)) {
    minv--;
    maxv--;
    maxv += cnt[3200];
  }
  cout << minv << " ";
  cout << maxv << endl;
  return 0;
}
