#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = MOD * MOD;
const long double EPS = 1e-9;
long long gcd(long long m, long long n) {
  long long a = max(m, n);
  long long b = min(m, n);
  while (b != 1 && b != 0) {
    a %= b;
    swap(a, b);
  }
  return b == 1 ? 1 : a;
}
long long lcm(long long m, long long n) { return m / gcd(m, n) * n; }
long long power_mod(long long a, long long power, long long mod) {
  long long value = 1;
  while (power != 0) {
    if (power & 1) value = (value * a) % mod;
    a = (a * a) % mod;
    power = power >> 1;
  }
  return value % mod;
}
long long modinv(long long a, long long mod) {
  return power_mod(a, mod - 2, mod);
}
long long power_normal(long long a, long long power) {
  long long value = 1;
  while (power != 0) {
    if (power & 1) value = value * a;
    a = a * a;
    power = power >> 1;
  }
  return value;
}
long long combination(long long n, long long r) {
  long long numerator = 1;
  long long denomenator = 1;
  for (long long i = 0; i < r; i++) {
    (numerator *= long long(n - i)) %= MOD;
    (denomenator *= modinv(i + 1, MOD)) %= MOD;
  }
  return (numerator * denomenator) % MOD;
}
long long bin_search_range(long long key, long long S[], long long left,
                           long long right) {
  while (right >= left) {
    long long mid = left + (right - left) / 2;
    if (S[mid] >= key && S[mid - 1] < key)
      return mid;
    else if (S[mid - 1] >= key)
      right = mid - 1;
    else if (S[mid] < key)
      left = mid + 1;
  }
  return right + 1;
}
long long bin_search(long long key, long long A[], long long left,
                     long long right) {
  while (right >= left) {
    long long mid = left + (right - left) / 2;
    if (A[mid] == key)
      return mid;
    else if (A[mid] > key)
      right = mid - 1;
    else if (A[mid] < key)
      left = mid + 1;
  }
  return -1;
}
const long long MAX_N = 100000;
int main(void) {
  long long n;
  long long a[100];
  long long c[9];
  cin >> (n);
  for (long long((i)) = 0; ((i)) < ((n)); ((i))++) cin >> (a[(i)]);
  for (long long(i) = 0; (i) < (8); (i)++) c[i] = 0;
  for (long long(i) = 0; (i) < (n); (i)++) {
    long long l, r;
    l = 0;
    r = 399;
    for (long long(j) = 0; (j) < (8); (j)++) {
      if ((l) <= (a[i]) && (a[i]) <= (r)) {
        c[j]++;
        break;
      }
      l += 400;
      r += 400;
    }
    if (a[i] >= 3200) c[8]++;
  }
  long long answer[2] = {0, 0};
  for (long long(j) = 0; (j) < (8); (j)++)
    if (c[j]) answer[0]++;
  answer[1] = answer[0] + c[8];
  cout << answer[0] << " " << answer[1] << endl;
  return 0;
}
