#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
  int n;
  cin >> n;
  map<int, int> x;
  int wild = 0;
  for (int i = 0; i < (n); ++i) {
    int a;
    cin >> a;
    if (a < 3200)
      x[a / 400]++;
    else
      wild++;
  }
  int sz = x.size();
  printf("%d %d\n", max(sz, 1), min(8, sz + wild));
}
