#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007ll;
const long long inf = 1000000000000000ll;
const long long nmax = 2 * 100000 + 1;
long long lis[9];
int main() {
  long long n, a, tmp, amin, amax;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a;
    for (long long j = 0; j < 8; j++) {
      if (400 * j <= a && a < 400 * (j + 1) - 1) lis[j] = 1;
    }
    if (400 * 8 <= a && a < 400 * (8 + 1) - 1) lis[8]++;
  }
  tmp = accumulate(lis, lis + 8, 0);
  amin = tmp;
  amax = tmp;
  if (lis[7] > 0) {
    if (amin == 0) amin = 1;
    amax += lis[8];
  }
  cout << amin << " " << amax << endl;
  return 0;
}
