#include <bits/stdc++.h>
using namespace std;
void mul_mod(long long& a, long long b) {
  a *= b;
  a %= (1000000007ll);
}
void add_mod(long long& a, long long b) {
  b += (1000000007ll);
  a += b;
  a %= (1000000007ll);
}
int main(void) {
  int n, cnt[9], a, i, ans = 0;
  fill(cnt, cnt + 9, 0);
  cin >> n;
  for (i = 0; i < n; ++i) {
    cin >> a;
    ++cnt[min(a / 400, 8)];
  }
  for (i = 0; i < 8; ++i) {
    if (cnt[i]) {
      ++ans;
    }
  }
  cout << (ans + ((cnt[8] && (!ans)) ? 1 : 0)) << " " << min(8, ans + cnt[8])
       << endl;
  return 0;
}
