#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int(i) = 0; (i) < (n); (i)++) cin >> a[i];
  sort((a).begin(), (a).end());
  int ck[] = {0, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200, 999999};
  vector<int> rk(10);
  for (int(i) = 0; (i) < (n); (i)++) {
    for (int(j) = 0; (j) < (10); (j)++) {
      if (ck[j] <= a[i] && a[i] < ck[j + 1]) {
        rk[j]++;
        break;
      }
    }
  }
  long long ans = 0;
  for (int(i) = 0; (i) < (8); (i)++)
    if (rk[i] != 0) ans++;
  cout << ans << " " << ans + rk[8] << "\n";
  return 0;
}
