#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
void solve() {
  int N;
  int crown = 0;
  cin >> N;
  for (int i = 1; i <= N; i++) {
    int a;
    cin >> a;
    if (a < 3200)
      mp[a / 400]++;
    else
      crown++;
  }
  int minimum = mp.size();
  if (minimum == 0 and crown != 0) minimum = 1;
  int maximum1 = mp.size() + crown;
  if (maximum1 > 8) maximum1 = 8;
  cout << minimum << " " << maximum1 << endl;
}
int main() {
  solve();
  return 0;
}
