#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
template <class Type>
Type modpow(Type a, Type n, Type mod) {
  Type res = 1;
  while (0 < n) {
    if (n & 1) {
      res = res * a % mod;
    }
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
template <class Type>
Type gcd(Type x, Type y) {
  Type r;
  if (x < y) swap(x, y);
  while (0 < y) {
    r = x % y;
    x = y;
    y = r;
  }
  return x;
}
template <class Type>
Type lcm(Type x, Type y) {
  return x * y / gcd(x, y);
}
template <class Type>
bool is_prime(Type x) {
  if (x == 2) return true;
  if (x < 2 || x % 2 == 0) return false;
  for (Type i = 3; i <= sqrt(x); i += 2) {
    if (x % i == 0) return false;
  }
  return true;
}
template <class Type>
vector<bool> eratos(Type n) {
  vector<bool> isPrime(n + 1, true);
  isPrime[0] = isPrime[1] = false;
  for (Type i = 2; i <= n; i++) {
    if (isPrime[i]) {
      Type j = i + i;
      while (j <= n) {
        isPrime[j] = false;
        j = j + i;
      }
    }
  }
  return isPrime;
}
bool binary_search_judge(vector<int> a, int index, int key) {
  if (key <= a[index])
    return true;
  else
    return false;
}
int binary_search(vector<int> a, int key) {
  int ng = -1;
  int ok = a.size();
  while (1 < abs(ng - ok)) {
    int mid = (ng + ok) / 2;
    if (binary_search_judge(a, mid, key))
      ok = mid;
    else
      ng = mid;
  }
  return a[ok] == key;
}
int main() {
  int n;
  cin >> n;
  vector<int> rate(9);
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    if (a / 400 == 0 && rate[0] == 0)
      rate[0]++;
    else if (a / 400 == 1 && rate[1] == 0)
      rate[1]++;
    else if (a / 400 == 2 && rate[2] == 0)
      rate[2]++;
    else if (a / 400 == 3 && rate[3] == 0)
      rate[3]++;
    else if (a / 400 == 4 && rate[4] == 0)
      rate[4]++;
    else if (a / 400 == 5 && rate[5] == 0)
      rate[5]++;
    else if (a / 400 == 6 && rate[6] == 0)
      rate[6]++;
    else if (a / 400 == 7 && rate[7] == 0)
      rate[7]++;
    else if (8 <= a / 400)
      rate[8]++;
  }
  int min_color_num = 0;
  int max_color_num = 0;
  for (int i = 0; i < 8; i++) min_color_num += rate[i];
  max_color_num = min_color_num + rate[8];
  cout << min_color_num << " " << max_color_num << endl;
}
