#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
  int n;
  cin >> n;
  vector<int> m(9, 0);
  for (int i = 0; i < (int)(n); i++) {
    int a;
    cin >> a;
    a /= 400;
    if (a >= 8) a = 8;
    m[a]++;
  }
  int mi, ma;
  if (m[8] > 0) {
    int t = 0;
    for (int i = 0; i < (int)(8); i++) {
      if (m[i] > 0) t++;
    }
    mi = t;
    ma = min(t + m[8], 8);
  } else {
    int t = 0;
    for (int i = 0; i < (int)(8); i++) {
      if (m[i] > 0) t++;
    }
    mi = t;
    ma = t;
  }
  cout << mi << " " << ma << endl;
}
