#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < (int)(n); ++i) cin >> a[i];
  vector<int> rate(8);
  int wild = 0;
  for (int i = 0; i < (int)(n); ++i) {
    if (a[i] < 3200) {
      rate[a[i] / 400]++;
    } else {
      wild++;
    }
  }
  int count = 0;
  for (int i = 0; i < (int)(8); ++i) {
    if (0 < rate[i]) count++;
  }
  int mn = 0;
  if (count == 0 && 0 < wild) {
    mn = 1;
  } else {
    mn = count;
  }
  int mx = min(8, wild + count);
  cout << mn << " " << mx << endl;
  return 0;
}
