#include <bits/stdc++.h>
using namespace std;
int extras;
set<int> there, not_there;
int main() {
  for (int i = 0; i < 8; ++i) not_there.insert(i);
  int n;
  cin >> n;
  for (int i = 0, x; i < n; ++i) {
    cin >> x;
    x /= 400;
    if (x >= 8)
      ++extras;
    else
      there.insert(x), not_there.erase(x);
  }
  cout << max<int>(there.size(), 1) << ' '
       << there.size() + min<int>(extras, not_there.size()) << endl;
  return 0;
}
