#include <bits/stdc++.h>
using namespace std;
const int IINF = 1e9;
const long long LINF = 1e18;
const long long mod = 1e9 + 7;
int main() {
  int N;
  cin >> N;
  int a[N];
  for (int i = 0; i < (int)(N); i++) cin >> a[i];
  int c[9];
  fill(c, c + 9, 0);
  for (int i = 0; i < (int)(N); i++) {
    c[min(a[i] / 400, 8)]++;
  }
  int mn = 0;
  for (int i = 0; i < (int)(8); i++) {
    if (c[i]) mn++;
  }
  int mx = min(8, mn + c[8]);
  cout << mn << " " << mx << endl;
  return 0;
}
