#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INFi = 1000000005;
long long INFll = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
int memo[301];
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int main() {
  int n;
  cin >> n;
  int a, ans = 1;
  set<int> st;
  int ct = 0;
  for (int(i) = (0); (i) < (n); ++(i)) {
    cin >> a;
    if (a < 3200) {
      st.insert(a / 400);
    } else {
      ct++;
    }
  }
  int as = (st.size() + ct);
  cout << st.size() << " " << min(as, 8) << endl;
  return 0;
}
