#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a / gcd(a, b) * b;
}
const long long int INF = 1e15;
signed main() {
  long long int N;
  cin >> N;
  map<long long int, long long int> m;
  long long int num;
  long long int free = 0;
  for (long long int i = 0; i < (long long int)(N); i++) {
    cin >> num;
    num /= 400;
    if (num >= 8)
      free++;
    else
      m[num]++;
  }
  if (m.size() == 0)
    cout << 1 << " " << min(8ll, free);
  else {
    long long int mn = m.size();
    long long int mx = min(mn + free, 8ll);
    cout << mn << " " << mx;
  }
}
