#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long N;
  cin >> N;
  set<long long> que;
  long long max_ans = 0, min_ans = 0;
  for (long long i = 0; i < N; i++) {
    long long a;
    cin >> a;
    a /= 400;
    if (a >= 8 and que.count(8)) max_ans++;
    que.insert(min(a, 8LL));
  }
  min_ans = que.size();
  max_ans += que.size();
  if (que.count(8)) {
    min_ans--;
  }
  cout << min(8LL, min_ans) << " " << max_ans << endl;
}
