#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using V = vector<ll>;
using P = pair<ll, ll>;
int main() {
  ll n;
  cin >> n;
  vector<ll> cnt(9, 0);
  for (int i = 0; i < n; ++i) {
    ll a;
    cin >> a;
    cnt[a / 400]++;
  }
  ll mint = 0, mx = 0;
  for (int j = 0; j < 9; ++j) {
    if (j < 8) {
      if (cnt[j] > 0) mint++;
    } else {
      if (cnt[j] > 0) mx += cnt[j];
    }
  }
  cout << mint << " " << mint + mx << endl;
  return 0;
}
