#include <bits/stdc++.h>
using namespace std;
int main() {
  long long N;
  cin >> N;
  unordered_map<int, int> um;
  for (int i = 0; i < N; i++) {
    long long tmp;
    cin >> tmp;
    if (tmp <= 399) {
      um[0]++;
    } else if (tmp <= 1199) {
      um[1]++;
    } else if (tmp <= 1599) {
      um[2]++;
    } else if (tmp <= 1999) {
      um[3]++;
    } else if (tmp <= 2399) {
      um[4]++;
    } else if (tmp <= 2799) {
      um[5]++;
    } else if (tmp <= 3199) {
      um[6]++;
    } else {
      um[7]++;
    }
  }
  long long cnt = 0;
  for (int i = 0; i <= 6; i++) {
    if (um[i] > 0) cnt++;
  }
  cout << max(1LL, cnt) << " " << cnt + um[7] << endl;
  return 0;
}
