#include <bits/stdc++.h>
using namespace std;
const double EPS = (1e-7);
const long long INF = (1e13);
const double PI = (acos(-1));
const long long MOD = long long(1e9) + 7;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long pow(long long a, long long b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return pow(a * a, b / 2);
  else
    return pow(a * a, b / 2) * a;
}
long long pow(long long a, long long b, long long m) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return (pow(a * a, b / 2, m) % m);
  else
    return (pow(a * a, b / 2) * a) % m;
}
long long residue(long long a, long long m) { return ((a % m) + m) % m; };
long long dx[4] = {1, 0, -1, 0};
long long dy[4] = {0, 1, 0, -1};
long long N;
set<long long> s;
int main() {
  cin >> N;
  long long temp = 0;
  for (long long i = 0; i < (long long)(N); i++) {
    long long a;
    cin >> a;
    if (a < 3200)
      s.insert(a / 400);
    else
      temp++;
  }
  printf("%lld %lld\n", s.size(), min(8ll, (long long)(s.size()) + temp));
}
