#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int nax = 2e6 + 7;
const long long mod = 1e9 + 7;
int count(long long x) {
  int cnt = 0;
  while (x != 0) {
    cnt++;
    x /= 10;
  }
  return cnt;
}
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  int cnt[11] = {0};
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    cnt[x / 400]++;
  }
  int cnt1 = 0, cnt2 = 0;
  for (int i = 0; i <= 7; i++) {
    if (cnt[i] >= 1) cnt1++;
  }
  for (int i = 8; i <= 10; i++) {
    if (cnt[i] >= 1) cnt2 += cnt[i];
  }
  cout << cnt1 << " " << min(8, cnt1 + cnt2) << endl;
  return 0;
}
