#include <bits/stdc++.h>
using namespace std;
int a[1001];
int c[10];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  memset(c, 0, sizeof(c));
  int i;
  for (i = 0; i < n; i++) {
    if (1 <= a[i] && a[i] <= 399) c[0]++;
    if (400 <= a[i] && a[i] <= 799) c[1]++;
    if (800 <= a[i] && a[i] <= 1199) c[2]++;
    if (1200 <= a[i] && a[i] <= 1599) c[3]++;
    if (1600 <= a[i] && a[i] <= 1999) c[4]++;
    if (2000 <= a[i] && a[i] <= 2399) c[5]++;
    if (2400 <= a[i] && a[i] <= 2799) c[6]++;
    if (2800 <= a[i] && a[i] <= 3199) c[7]++;
    if (a[i] > 3199) break;
  }
  int ans = 0;
  for (int i = 0; i < 8; i++) {
    if (c[i]) ans++;
  }
  if (i == n)
    cout << ans << " " << ans << endl;
  else
    cout << ans << " " << n - i + ans << endl;
  return 0;
}
