#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589;
const int INF = 1000000007;
const long long LMAX = 1000000000000001;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  long long c = a % b;
  while (c != 0) {
    a = b;
    b = c;
    c = a % b;
  }
  return b;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
  int n;
  cin >> n;
  vector<int> k(9, 0);
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    if (a < 400)
      k[0]++;
    else if (a < 800)
      k[1]++;
    else if (a < 1200)
      k[2]++;
    else if (a < 1600)
      k[3]++;
    else if (a < 2000)
      k[4]++;
    else if (a < 2400)
      k[5]++;
    else if (a < 2800)
      k[6]++;
    else if (a < 3200)
      k[7]++;
    else
      k[8]++;
  }
  int m = 0;
  for (int i = 0; i < 8; i++) {
    if (k[i] > 0) m++;
  }
  if (m == 0)
    cout << 1 << " ";
  else
    cout << m << " ";
  if (m + k[8] > 8)
    cout << 8 << endl;
  else
    cout << m + k[8] << endl;
  return 0;
}
