#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 50;
static const int NIL = -1;
static const int MOD = 1000000007;
int gcd(int a, int b) {
  int c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int lcm(int a, int b) {
  int c = gcd(a, b);
  a /= c;
  return a * b;
}
int nCr(int a, int b) {
  int i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
int pow(int a, int b) {
  int i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= a;
  }
  return r;
}
long long llpow(long long a, long long b) {
  long long i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= a;
  }
  return r;
}
long long llgcd(long long a, long long b) {
  long long c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
long long lllcm(long long a, long long b) {
  long long c = llgcd(a, b);
  a /= c;
  return a * b;
}
long long llnCr(long long a, long long b) {
  long long i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
struct edge {
  int from, to;
  long long cost;
};
int main() {
  int n;
  cin >> n;
  vector<int> a;
  for (int i = 0; i < (n); ++i) {
    int tmp;
    cin >> tmp;
    a.push_back(tmp);
  }
  sort(a.begin(), a.end());
  ;
  int cnt[9];
  for (int i = 0; i < (9); ++i) cnt[i] = 0;
  for (int i = 0; i < (n); ++i) {
    for (int j = 400; j < 5600; j += 400) {
      if (a[i] < j) {
        if (j / 400 - 1 > 8) {
          cnt[8]++;
        } else {
          cnt[j / 400 - 1]++;
        }
        break;
      }
    }
  }
  int minan = 0;
  for (int i = 0; i < (8); ++i) {
    if (cnt[i]) minan++;
  }
  if (minan == 0) {
    minan = 0;
    cnt[8]--;
  }
  cout << minan << " " << minan + cnt[8] << endl;
}
