#include <bits/stdc++.h>
const int INF = 1e9;
const long long LLINF = 1e15;
using namespace std;
int clorlim[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
int main() {
  int N;
  cin >> N;
  vector<int> v;
  for (int i = 0; i < N; i++) {
    int tmp;
    cin >> tmp;
    v.push_back(tmp);
  }
  sort(v.begin(), v.end());
  vector<int> tv;
  set<int> s;
  for (int i = 0; i < N; i++) {
    bool flag = false;
    for (int j = 0; j < 8; j++) {
      if (v[i] < clorlim[j]) {
        s.insert(j);
        flag = true;
        break;
      }
    }
    if (!flag) {
      tv.push_back(v[i]);
    }
  }
  cout << s.size() << " " << s.size() + tv.size() << endl;
  return 0;
}
