#include <bits/stdc++.h>
using namespace std;
const int INF = (long long int)(1 << 30) - 1;
const long long int INFl = (long long int)9223372036854775807;
const int MAX = 10000;
const long long int MOD = (long long int)1e9 + 7;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a / gcd(a, b) * b;
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int n;
int a[9];
int main() {
  cin >> n;
  int t;
  for (int i = 0; i < n; i++) {
    cin >> t;
    t /= 400;
    if (t >= 8) {
      a[8]++;
    } else {
      a[t]++;
    }
  }
  int s = 0;
  for (int i = 0; i < 8; i++)
    if (a[i] > 0) s++;
  int m = s;
  if (s == 0) {
    s = 1;
    if (a[8] < 8) {
      m = a[8];
    } else {
      m = 8;
    }
  } else if (s < 8) {
    if (s + a[8] >= 8) {
      m = 8;
    } else {
      m = s + a[8];
    }
  }
  cout << s << " " << m << endl;
  return 0;
}
