#include <bits/stdc++.h>
using namespace std;
template <typename Tn>
Tn gcd(Tn a, Tn b) {
  return (b ? gcd(b, a % b) : a);
}
template <typename Tn>
Tn lcm(Tn a, Tn b) {
  return a / gcd(a, b) * b;
}
long long int cnt = 0;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
  int n;
  cin >> n;
  int a[10] = {};
  for (int i = 0; i < n; i++) {
    int m;
    cin >> m;
    a[m / 400]++;
  }
  for (int i = 0; i < 8; i++)
    if (a[i]) cnt++;
  cout << cnt << ' ' << min((int)cnt + a[8], 8) << endl;
  return 0;
}
