#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void chmax(T& a, T b) {
  if (a < b) {
    a = b;
  }
}
template <class T>
inline void chmin(T& a, T b) {
  if (a > b) {
    a = b;
  }
}
template <class T>
inline T gcd(T x, T y) {
  if (y == 0) {
    return x;
  } else if (x == 0) {
    return y;
  }
  return gcd(y, x % y);
}
template <class T>
inline T lcm(T x, T y) {
  return (x * y) / gcd(x, y);
}
template <class T>
inline vector<T> convert_to_binary_number(T x) {
  vector<T> binary_num;
  while (x != 1) {
    binary_num.push_back(x % 2);
    x /= 2;
  }
  binary_num.push_back(1);
  return binary_num;
}
template <class T>
inline void print_vector(vector<T> vec) {
  for (int i = 0; i < vec.size(); i++) {
    cout << vec[i] << " ";
  }
  cout << endl;
}
vector<long long> make_divisors(long long n) {
  vector<long long> divisors;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      divisors.push_back(i);
      if (i != n / i) {
        divisors.push_back(n / i);
      }
    }
  }
  return divisors;
}
const long long MOD = 1e9 + 7;
const int INF = 1 << 30;
const long long LLINF = 1LL << 60;
using namespace std;
int main(void) {
  int N;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < N; i++) cin >> a[i];
  int v_max = 0;
  vector<int> rating(8);
  for (int i = 0; i < N; i++) {
    if (a[i] < 400)
      rating[0] = 1;
    else if (a[i] < 800)
      rating[1] = 1;
    else if (a[i] < 1200)
      rating[2] = 1;
    else if (a[i] < 1600)
      rating[3] = 1;
    else if (a[i] < 2000)
      rating[4] = 1;
    else if (a[i] < 2400)
      rating[5] = 1;
    else if (a[i] < 2800)
      rating[6] = 1;
    else if (a[i] < 3200)
      rating[7] = 1;
    else if (a[i] >= 3200)
      v_max++;
  }
  cout << accumulate((rating).begin(), (rating).end(), 0) << " ";
  cout << accumulate((rating).begin(), (rating).end(), v_max) << endl;
  return 0;
}
