#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  vector<int> v;
  scanf("%d", &n);
  v.resize(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &v[i]);
  }
  sort(v.begin(), v.end(), greater<int>());
  int cnt = 0;
  int a[8] = {};
  for (int i = 0; i < n; i++) {
    if (1 <= v[i] && v[i] <= 399) {
      a[0] = 1;
    }
    if (400 <= v[i] && v[i] <= 799) {
      a[1] = 1;
    }
    if (800 <= v[i] && v[i] <= 1199) {
      a[2] = 1;
    }
    if (1200 <= v[i] && v[i] <= 1599) {
      a[3] = 1;
    }
    if (1600 <= v[i] && v[i] <= 1999) {
      a[4] = 1;
    }
    if (2000 <= v[i] && v[i] <= 2399) {
      a[5] = 1;
    }
    if (2400 <= v[i] && v[i] <= 2799) {
      a[6] = 1;
    }
    if (2800 <= v[i] && v[i] <= 3199) {
      a[7] = 1;
    }
    if (3200 <= v[i]) {
      cnt += 1;
    }
  }
  int ans = 0;
  for (int i = 0; i < 8; i++) {
    if (a[i] == 1) {
      ans += 1;
    }
  }
  if (ans == 0) {
    if (cnt >= 8) {
      printf("%d %d\n", 1, 8);
    } else {
      printf("%d %d\n", 1, cnt);
    }
  } else {
    if (ans + cnt <= 8) {
      printf("%d %d\n", ans, ans + cnt);
    } else {
      printf("%d %d\n", ans, 8);
    }
  }
}
