#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 50;
int solve();
int main(void) {
  while (solve()) {
  }
  return 0;
}
int solve() {
  vector<int> hist(10, 0);
  int N;
  cin >> N;
  int ex = 0;
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    if (a < 3200) {
      hist[a / 400 - 1]++;
    } else {
      ex++;
    }
  }
  int cnt = 0;
  for (int i = 0; i < hist.size(); i++) {
    if (hist[i] > 0) cnt++;
  }
  int amin = cnt;
  if (ex > 0 && cnt == 0) amin = 1;
  int amax = min(cnt + ex, 8);
  std::cout << amin << " " << amax << endl;
  return 0;
}
