#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
  cin.sync_with_stdio(false);
  int N;
  cin >> N;
  vector<int> a(N);
  int top = 0;
  for (int i = 0; i < (int)(N); i++) {
    cin >> a[i];
    a[i] = a[i] / 400;
    if (a[i] == 8) top++;
  }
  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
  int minN, maxN;
  if (top != 0) {
    maxN = a.size() - 1 + top;
    minN = a.size() - 1;
  } else {
    maxN = a.size();
    minN = a.size();
  }
  cout << minN << " " << maxN << endl;
  return 0;
}
