#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T, class U>
using P = pair<T, U>;
template <class T>
using Heap = priority_queue<T>;
template <class T>
using heaP = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U>
using umap = unordered_map<T, U>;
template <class T>
using uset = unordered_set<T>;
template <class T>
bool ChangeMax(T& a, const T& b) {
  if (a >= b) return false;
  a = b;
  return true;
}
template <class T>
bool ChangeMin(T& a, const T& b) {
  if (a <= b) return false;
  a = b;
  return true;
}
template <class T, size_t N, class U>
void Fill(T (&a)[N], const U& v) {
  fill((U*)a, (U*)(a + N), v);
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& e : v) is >> e;
  return is;
}
int main() {
  int n;
  cin >> n;
  int mp[8] = {};
  int fr = 0;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    x /= 400;
    if (x >= 8)
      fr++;
    else
      mp[x]++;
  }
  int sum = 0;
  for (int i = 0; i < 8; ++i) sum += !!mp[i];
  if (fr == 0) {
    cout << sum << ' ' << sum << endl;
  } else {
    cout << sum << ' ' << sum + min(8 - sum, fr) << endl;
  }
}
