#include <bits/stdc++.h>
using namespace std;
bool prime[1000001];
void debug(long long int a) { cout << a << endl; }
long long int sieve(long long int a) {
  memset(prime, true, sizeof(prime));
  long long int p, i;
  for (p = 2; p * p <= a; p++) {
    if (prime[p] == true) {
      for (i = p * 2; i <= a; i += p) prime[i] = false;
    }
  }
  return 0;
}
long long int powermod(long long int _a, long long int _b, long long int _m) {
  long long int _r = 1;
  while (_b) {
    if (_b % 2 == 1) _r = (_r * _a) % _m;
    _b /= 2;
    _a = (_a * _a) % _m;
  }
  return _r;
}
long long int find_max(long long int __a, long long int __b) {
  return __a ^ ((__a ^ __b) & -(__a < __b));
}
long long int add(long long int __a, long long int __b, long long int MOD) {
  long long int x = (__a + __b) % MOD;
  return x;
}
long long int mul(long long int a, long long int b, long long int MOD) {
  long long int x = (a * b) % MOD;
  return x;
}
long long int sub(long long int a, long long int b, long long int MOD) {
  long long int x = (a - b + MOD) % MOD;
  return x;
}
long long int div(long long int a, long long int b, long long int MOD) {
  long long int x = a;
  long long int y = powermod(b, MOD - 2, MOD);
  long long int res = (x * y) % MOD;
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(20);
  long long int t, i, j;
  t = 1;
  long long int counter1 = 0;
  while (t--) {
    counter1++;
    int n;
    cin >> n;
    int a[n];
    for (i = 0; i < n; i++) cin >> a[i];
    int answer[9] = {0};
    for (i = 0; i < n; i++) {
      if (a[i] >= 1 && a[i] <= 399)
        answer[0]++;
      else if (a[i] >= 400 && a[i] <= 799)
        answer[1]++;
      else if (a[i] >= 800 && a[i] <= 1199)
        answer[2]++;
      else if (a[i] >= 1200 && a[i] <= 1599)
        answer[3]++;
      else if (a[i] >= 1600 && a[i] <= 1990)
        answer[4]++;
      else if (a[i] >= 2000 && a[i] <= 2399)
        answer[5]++;
      else if (a[i] >= 2400 && a[i] <= 2799)
        answer[6]++;
      else if (a[i] >= 2800 && a[i] <= 3199)
        answer[7]++;
      else
        answer[8]++;
    }
    int ans = 0;
    for (i = 0; i < 8; i++)
      if (answer[i] > 0) ans++;
    if (ans == 8) answer[8] = 0;
    cout << ans << " " << ans + answer[8] << endl;
  }
}
