#include <bits/stdc++.h>
using namespace std;
int A[1111];
int main() {
  int N;
  cin >> N;
  for (int i = 0; i < N; i++) cin >> A[i];
  vector<pair<int, int> > colors;
  colors.push_back(make_pair(1, 399));
  colors.push_back(make_pair(400, 799));
  colors.push_back(make_pair(800, 1199));
  colors.push_back(make_pair(1200, 1599));
  colors.push_back(make_pair(1600, 1999));
  colors.push_back(make_pair(2000, 2399));
  colors.push_back(make_pair(2400, 2799));
  colors.push_back(make_pair(2800, 3199));
  set<int> dist_colors;
  int num_free = 0;
  for (int i = 0; i < N; i++) {
    bool found = false;
    for (int j = 0; j < colors.size(); j++) {
      if (A[i] >= colors[j].first && A[i] <= colors[j].second) {
        dist_colors.insert(j);
        found = true;
        break;
      }
    }
    if (!found) num_free++;
  }
  printf("%lu %lu\n", dist_colors.size(), dist_colors.size() + num_free);
}
