#include <bits/stdc++.h>
using namespace std;
long long int dig(long long int N, long long int K) {
  long long int dig = 0;
  while (N) {
    dig++;
    N /= K;
  }
  return dig;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  long long int g = gcd(a, b);
  return a / g * b;
}
long long int C(long long int N) { return N * (N - 1) / 2; }
const double PI = 3.14159265358979323846;
int main() {
  int N;
  cin >> N;
  vector<long long int> a(N);
  for (int i = 0; i < N; i++) cin >> a[i];
  vector<long long int> b(8);
  int cnt = 0;
  for (int i = 0; i < N; i++) {
    if (a[i] >= 1 && a[i] <= 399)
      b[0] = 1;
    else if (a[i] <= 799)
      b[1] = 1;
    else if (a[i] <= 1199)
      b[2] = 1;
    else if (a[i] <= 1599)
      b[3] = 1;
    else if (a[i] <= 1999)
      b[4] = 1;
    else if (a[i] <= 2399)
      b[5] = 1;
    else if (a[i] <= 2799)
      b[6] = 1;
    else if (a[i] <= 3199)
      b[7] = 1;
    else
      cnt++;
  }
  int ans = 0;
  for (int i = 0; i < 8; i++) ans += b[i];
  cout << ans << ' ' << ans + cnt << endl;
}
