#include <bits/stdc++.h>
using namespace std;
vector<int> B{399, 799, 1199, 1599, 1999, 2399, 2799, 3199};
int main() {
  int n;
  cin >> n;
  vector<int> A(n);
  for (int i = 0; i < n; i++) cin >> A[i];
  set<int> S;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    int idx = lower_bound(B.begin(), B.end(), A[i]) - B.begin();
    if (idx == B.size()) {
      cnt++;
      continue;
    }
    S.insert(idx);
  }
  cout << S.size() << " " << cnt + S.size() << endl;
  return 0;
}
