#include <bits/stdc++.h>
using namespace std;
const int C = 9;
const int INF = 1 << 30;
const int RNS[C] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200, INF};
int cs[C];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int ai;
    cin >> ai;
    int k = upper_bound(RNS, RNS + C, ai) - RNS;
    cs[k]++;
  }
  int minc = 0;
  for (int i = 0; i < C - 1; i++)
    if (cs[i]) minc++;
  printf("%d %d\n", minc, minc + cs[C - 1]);
  return 0;
}
