#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
using Pll = pair<P, long long>;
using PQ = priority_queue<P, vector<P>, greater<P>>;
signed main() {
  long long n;
  cin >> n;
  long long cnt[9] = {};
  for (long long i = 0; i < n; i++) {
    long long a;
    cin >> a;
    cnt[a / 400]++;
  }
  long long ans = 0;
  for (long long i = 0; i < 9; i++) {
    if (i < 8 && cnt[i] > 0) ans++;
  }
  cout << ans + ((ans) ? 0 : 1) << " " << ans + cnt[8] << endl;
  return 0;
}
