#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template <class T>
inline void chmin(T& a, T b) {
  if (a > b) a = b;
}
template <class T>
inline void chmax(T& a, T b) {
  if (a < b) a = b;
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& v) {
  o << "{";
  for (int i = 0; i < (int)v.size(); i++) o << (i > 0 ? ", " : "") << v[i];
  o << "}";
  return o;
}
long long const mod = 1e9 + 7;
int main() {
  int N;
  cin >> N;
  map<int, int> col;
  int a, free = 0;
  for (int i = 0; i < N; i++) {
    cin >> a;
    a /= 400;
    if (a <= 7)
      col[a]++;
    else
      free++;
  }
  cout << col.size() << ' ' << (int)col.size() + free << endl;
}
