#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
int x_pos[4] = {1, 0, -1, 0}, y_pos[4] = {0, 1, 0, -1};
int ctoi(char c) {
  if (c >= '0' && c <= '9') {
    return c - '0';
  }
  return 0;
}
char upper(char c) { return c - 0x20; }
char lower(char c) { return c + 0x20; }
int gcd(int x, int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int lcm(int x, int y) {
  int g = gcd(x, y);
  return x / g * y;
}
int facctorialMethod(int k) {
  int sum = 1;
  for (int i = 1; i <= k; ++i) {
    sum = (sum % MOD * i % MOD) % MOD;
  }
  return sum;
}
int main() {
  int n;
  cin >> n;
  int li[9] = {};
  for (int i = 0; i < (n); ++i) {
    int a;
    cin >> a;
    bool found = false;
    for (int j = 1; j <= 8; j++) {
      if (a < 400 * j) {
        li[j - 1]++;
        found = true;
        break;
      }
    }
    if (!found) {
      li[8]++;
    }
  }
  int ans = 0;
  for (int i = 0; i < (8); ++i) {
    if (li[i]) ans++;
  }
  cout << ans << " " << ans + li[8] << endl;
}
