#include <bits/stdc++.h>
using namespace std;
const int MOD = 9999973;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
const int MAX = 5100000;
unsigned long long fac[MAX], finv[MAX], inv[MAX];
unsigned long long kaijyo(long long n) {
  if (n == 0) return 1;
  return n * kaijyo(n - 1);
}
unsigned long long ansans(long long n, long long k) {
  return kaijyo(n) / kaijyo(n - k) / kaijyo(k);
}
long long fact[MAX], fact_inv[MAX];
long long power(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long comb(long long n, long long r) {
  return (fact[n] * fact_inv[r]) * fact_inv[n - r];
}
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int a[8];
  memset(a, 0, sizeof(a));
  int n;
  cin >> n;
  int b[n];
  int except = 0;
  for (int i = 0; i < n; i++) {
    int g;
    cin >> g;
    if (g < 3200)
      a[g / 400]++;
    else
      except++;
  }
  int ans_min = 0;
  for (int i = 0; i < 8; i++)
    if (a[i] > 0) ans_min++;
  cout << ans_min << " ";
  cout << min(ans_min + except, 8) << endl;
}
