#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 30;
const long long MOD = 1000000007;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  int n;
  cin >> n;
  int ans[9] = {0};
  int anmi = 0;
  int anma = 0;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    ans[min(a / 400, 8)]++;
  }
  for (int i = 0; i < 8; ++i) {
    if (ans[i] >= 1) {
      anma++;
      anmi++;
    }
  }
  if (anmi == 0 && ans[8] >= 1) anmi++;
  cout << anmi << " " << min(anma + ans[8], 9) << endl;
}
