#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
ll ADD(ll x, ll y) { return (x + y) % MOD; }
ll SUB(ll x, ll y) { return (x - y + MOD) % MOD; }
ll MUL(ll x, ll y) { return x * y % MOD; }
ll POW(ll x, ll e) {
  ll v = 1;
  for (; e; x = MUL(x, x), e >>= 1)
    if (e & 1) v = MUL(v, x);
  return v;
}
ll DIV(ll x, ll y) { return MUL(x, POW(y, MOD - 2)); }
priority_queue<int> q_descending;
priority_queue<int, vector<int>, greater<int> > q_ascending;
int a[575];
map<int, int> mp;
int main(void) {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < (int)(n); i++) {
    cin >> a[i];
    if (a[i] < 400)
      mp[0]++;
    else if (a[i] < 800)
      mp[1]++;
    else if (a[i] < 1200)
      mp[2]++;
    else if (a[i] < 1600)
      mp[3]++;
    else if (a[i] < 2000)
      mp[4]++;
    else if (a[i] < 2400)
      mp[5]++;
    else if (a[i] < 2800)
      mp[6]++;
    else if (a[i] < 3200)
      mp[7]++;
    else
      mp[8]++;
  }
  int maxn = 0, minn = 0;
  int non_niji = 0, niji = 0;
  for (auto itr = mp.begin(); itr != mp.end(); itr++) {
    if (itr->first == 8)
      niji += itr->second;
    else if (itr->first >= 0 && itr->first <= 7)
      non_niji++;
  }
  minn = non_niji;
  maxn = minn + niji;
  maxn = min(maxn, 8);
  if (maxn == 0) maxn++;
  cout << max(minn, 1) << " " << maxn << endl;
  return 0;
}
