#include <bits/stdc++.h>
using namespace std;
long double pi = acos(-1);
const int INF = 1001001001;
int euqlid(int a, int b) {
  int temp;
  temp = a % b;
  if (temp == 0) return b;
  return euqlid(b, temp);
}
long long conbination(long long a, long long b) {
  long long u = 1;
  long long d = 1;
  while (b != 0) {
    u *= a;
    d *= b;
    a--;
    b--;
  }
  return u / d;
}
int strtoint(char s) { return (int(s - '0')); }
int fact(int n) {
  if (n == 1) return 1;
  return n * fact(n - 1);
}
int main() {
  int n;
  cin >> n;
  int colors[9];
  ;
  for (int i = 0; i < (9); i++) colors[i] = 0;
  ;
  for (int i = 0; i < (n); i++) {
    int a;
    cin >> a;
    colors[(min(a / 400, 8))]++;
  }
  int min_n = 0;
  int max_n = 0;
  ;
  for (int i = 0; i < (8); i++)
    if (colors[i] != 0) min_n++;
  max_n = min_n + colors[8];
  cout << min_n << " " << max_n << endl;
}
