#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chmax(T& a, T& b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T& a, T& b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
pair<long long, long long> solve(int N, const vector<long long>& a) {
  int joker = false;
  bitset<8> res(0);
  for (int i = 0; i < (int)(N); ++i) {
    int inx = a[i] < 400    ? 0
              : a[i] < 800  ? 1
              : a[i] < 1200 ? 2
              : a[i] < 1600 ? 3
              : a[i] < 2000 ? 4
              : a[i] < 2400 ? 5
              : a[i] < 2800 ? 6
              : a[i] < 3200 ? 7
                            : 8;
    if (inx != 8)
      res[inx] = 1;
    else
      joker++;
  }
  long long mincolor = res.count() != 0 ? res.count() : 1;
  long long maxcolor = min((int)res.count() + joker, 8);
  return make_pair((mincolor), (maxcolor));
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin >> N;
  vector<long long> a(N);
  for (int i = 0; i < (int)(N); ++i) {
    cin >> a[i];
  }
  auto ans = solve(N, a);
  cout << ans.first << " " << ans.second << '\n';
  return 0;
}
