#include <bits/stdc++.h>
using namespace std;
long long gcd(long long p, long long q) {
  if (p < q) swap(p, q);
  if (p % q == 0)
    return q;
  else
    return gcd(p / q, p % q);
}
int keta(long long p, int q) {
  if (p / 10 == 0)
    return q + 1;
  else
    return keta(p / 10, q + 1);
}
long long kaijo(int p, int q) {
  if (p == 1)
    return q;
  else
    return kaijo(p - 1, p * q);
}
int main() {
  int N, count, MAX, MIN, tmp, color, memo;
  cin >> N;
  count = 0;
  tmp = 0;
  vector<long> score(N);
  for (int i = 0; i < (int)(N); i++) {
    cin >> score[i];
    if (score[i] > 3199) tmp++;
  }
  sort(score.begin(), score.end());
  color = 0;
  memo = 0;
  for (int i = 0; i < (int)(8); i++) {
    color += 400;
    for (int j = memo; j < N; j++) {
      if (score[j] >= color)
        break;
      else if (score[j] > color - 401 && score[j] < color) {
        count++;
        memo = j;
        break;
      }
    }
  }
  MIN = max(count, 1);
  MAX = min(count + tmp, 8);
  cout << MIN << " " << MAX << endl;
}
