#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
int factorial(int k) {
  int result = 1;
  for (int i = 1; i <= k; ++i) {
    result *= i;
  }
  return result;
}
int main() {
  int n;
  cin >> n;
  vector<int> cnt(9);
  int ans = 0;
  for (long long i = 0; i < (long long)(n); i++) {
    int a;
    cin >> a;
    if (a < 400) {
      cnt[0]++;
    } else if (a < 800) {
      cnt[1]++;
    } else if (a < 1200) {
      cnt[2]++;
    } else if (a < 1600) {
      cnt[3]++;
    } else if (a < 2000) {
      cnt[4]++;
    } else if (a < 2400) {
      cnt[5]++;
    } else if (a < 2800) {
      cnt[6]++;
    } else if (a < 3200) {
      cnt[7]++;
    } else
      cnt[8]++;
  }
  for (long long i = 0; i < (long long)(8); i++)
    if (cnt[i] > 0) ans++;
  if (cnt[8] == 0)
    cout << ans << " " << ans << endl;
  else
    cout << ans << " " << ans + cnt[8] << endl;
}
