#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
inline int gcd(int a, int b) { return (a % b == 0) ? b : gcd(b, a % b); }
inline int fac(int n) { return (n == 0) ? 1 : n * fac(n - 1); }
int main() {
  int n;
  cin >> n;
  int a[n];
  bool rate_num[9] = {};
  int players_num = 0;
  int gods_num = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    for (int j = 0; j < 9; j++) {
      if (400 * j <= a[i] && a[i] <= 400 * j + 399) {
        rate_num[j] = true;
        if (j < 8) {
          players_num++;
        } else {
          gods_num++;
        }
      }
    }
  }
  int colored_num = 0;
  for (int i = 0; i < 8; i++) {
    if (rate_num[i]) {
      colored_num++;
    }
  }
  int min = 0;
  int max = 0;
  max = colored_num + gods_num;
  max = max > n ? n : max;
  min = colored_num;
  min = gods_num > 0 && min == 0 ? 1 : min;
  min = min > n ? n : min;
  cout << min << " " << max << endl;
  return 0;
}
