#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
signed main() {
  int n;
  cin >> n;
  int a[9];
  for (ll i = 0; i < ll(9); i++) {
    a[i] = 0;
  }
  for (ll i = 0; i < ll(n); i++) {
    int number;
    cin >> number;
    if (number >= 3200) {
      a[8]++;
    } else {
      a[number / 400]++;
    }
  }
  int d_max = 0;
  int d_min = 0;
  for (ll i = 0; i < ll(8); i++) {
    if (a[i]) {
      d_min++;
    }
  }
  if (a[8] == n) {
    cout << 1 << " " << n << endl;
    return 0;
  }
  if (a[8]) {
    if (!d_min) {
      d_min = 1;
    }
    if (d_min + a[8] >= 8) {
      d_max = 8;
    } else {
      d_max = d_min + a[8];
    }
  } else {
    d_max = d_min;
  }
  cout << d_min << " " << d_max << endl;
  return 0;
}
