#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
constexpr int INF = 100000000;
constexpr long long LINF = 10000000000000000ll;
constexpr int MOD = static_cast<int>(1e9 + 7);
constexpr double EPS = 1e-9;
int N;
int rate[100];
bool c[8];
void init() {}
void solve() {
  int other = 0;
  int mi = 0, ma = 0;
  for (long long i = 0ll; i < static_cast<long long>(N); i++) {
    if (1 <= rate[i] && rate[i] <= 399) {
      c[0] = true;
    } else if (400 <= rate[i] && rate[i] <= 799) {
      c[1] = true;
    } else if (800 <= rate[i] && rate[i] <= 1199) {
      c[2] = true;
    } else if (1200 <= rate[i] && rate[i] <= 1599) {
      c[3] = true;
    } else if (1600 <= rate[i] && rate[i] <= 1999) {
      c[4] = true;
    } else if (2000 <= rate[i] && rate[i] <= 2399) {
      c[5] = true;
    } else if (2400 <= rate[i] && rate[i] <= 2799) {
      c[6] = true;
    } else if (2800 <= rate[i] && rate[i] <= 3199) {
      c[7] = true;
    } else {
      other++;
    }
  }
  for (long long i = 0ll; i < static_cast<long long>(8); i++) {
    if (c[i]) mi++;
  }
  ma = min(mi + other, 8);
  if (mi == 0) mi = 1;
  cout << mi << " " << ma << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N;
  for (long long i = 0ll; i < static_cast<long long>(N); i++) cin >> rate[i];
  solve();
  return 0;
}
