#include <bits/stdc++.h>
using namespace std;
inline bool IsPrime(int p) {
  if (p == 1) return false;
  for (int i = 2; i <= sqrt(p); i++) {
    if (p % i == 0) return false;
  }
  return true;
}
inline int GetDigit(int num) { return (int)log10(num) + 1; }
int GetDigitsSum(int num) {
  int N = 0;
  while (num > 0) {
    N += num % 10;
    num /= 10;
  }
  return N;
}
int combination(int n, int r) {
  if (r == 0 || n == r) {
    return 1;
  } else if (r == 1) {
    return n;
  } else {
    return combination(n - 1, r - 1) + combination(n - 1, r);
  }
}
int main() {
  int N;
  int colorful = 0;
  map<int, int> mp;
  cin >> N;
  for (int i = 0; i < N; i++) {
    int tmp;
    cin >> tmp;
    if (tmp >= 3200) {
      colorful++;
    } else {
      mp[tmp / 400]++;
    }
  }
  cout << (int)mp.size() << " " << (int)mp.size() + colorful << endl;
  return 0;
}
