#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double PI = acos(0.0) * 2;
template <typename T1>
T1 gcd(T1 a, T1 b) {
  return b ? gcd(b, a % b) : a;
}
bool vis[15];
int main() {
  int n, fr = 0, x;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    if (x >= 3200) {
      fr++;
      continue;
    }
    vis[x / 400] = 1;
  }
  int ans = 0;
  for (int i = 0; i < 10; i++) {
    if (vis[i]) ans++;
  }
  printf("%d %d\n", ans, min(ans + fr, 8));
  return 0;
}
