#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
  if (b > a) swap(a, b);
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
  ll g = gcd(a, b);
  return a / g * b;
}
ll rep_jijo(ll n, ll x) {
  if (x == 0) return 1;
  if (x % 2 == 0) {
    ll t = rep_jijo(n, x / 2);
    return t * t % 1000000007;
  }
  return n * rep_jijo(n, x - 1) % 1000000007;
}
ll com(ll n, ll r) {
  ll x = 1, y = 1;
  ll tmp = n;
  while (tmp >= n - r + 1) {
    x = x * tmp % 1000000007;
    tmp--;
  }
  while (r > 0) {
    y = y * r % 1000000007;
    r--;
  }
  return x * rep_jijo(y, 1000000007 - 2) % 1000000007;
}
int main() {
  int n;
  int x = 0;
  cin >> n;
  map<int, int> mp;
  for (int i = 0; i < (int)(n); i++) {
    int a;
    cin >> a;
    if (1 <= a && a <= 399) mp[0]++;
    if (400 <= a && a <= 799) mp[1]++;
    if (800 <= a && a <= 1199) mp[2]++;
    if (1200 <= a && a <= 1599) mp[3]++;
    if (1600 <= a && a <= 1999) mp[4]++;
    if (2000 <= a && a <= 2399) mp[5]++;
    if (2400 <= a && a <= 2799) mp[6]++;
    if (2800 <= a && a <= 3199) mp[7]++;
    if (a >= 3200) x++;
  }
  int mn = mp.size();
  if (mn == 0 && x > 0) mn = 1;
  int mx = mn + x;
  cout << mn << " " << mx << endl;
  return 0;
}
