#include <bits/stdc++.h>
using namespace std;
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
long long n;
long long a[200];
long long cou[9];
int main() {
  cin >> n;
  for (int i = 0; i < (n); i++) cin >> a[i];
  for (int i = 0; i < (n); i++) {
    bool f = true;
    for (int j = 0; j < (8); j++) {
      if (a[i] < (j + 1) * 400) {
        f = false;
        cou[j]++;
        break;
      }
    }
    if (f) {
      cou[8]++;
    }
  }
  long long ans1 = 0;
  for (int i = 0; i < (8); i++) {
    if (cou[i] > 0) ans1++;
  }
  if (cou[8] == 0) {
    cout << ans1 << " " << ans1 << endl;
    return 0;
  }
  cout << ans1 + (ans1 == 0) << " " << ans1 + min(cou[8], 8 - ans1) << endl;
  return 0;
}
