#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
  long N;
  cin >> N;

  vector<bool> flags(8);
  fill(flags.begin(), flags.end(), false);

  long fcnt = 0;
  for (long i = 0; i < N; i++) {
    long a;
    cin >> a;

    long idx = a / 400;
    if (idx >= 8) {
      fcnt++;
      continue;
    }

    flags[idx] = true;
  }

  long ccnt = 0;
  for (long i = 0; i < flags.size(); i++) {
    if (flags[i]) {
      ccnt++;
    }
  }

  cout << max(ccnt, 1) << ' ' << min(ccnt + fcnt, 8) << endl;

  return 0;
}
