#include <bits/stdc++.h>
using namespace std;
const long long INF = (1LL << 31) - 1;
const long long MOD = 1e9 + 7;
int n, a;
int f[1000];
int main() {
  cin >> n;
  for (int i = 0; i < (n); i++) {
    cin >> a;
    f[a / 400]++;
  }
  int cnt = 0;
  int ans = 0;
  for (int i = 0; i < (13); i++) {
    if (i >= 8 && f[i]) {
      ans += f[i];
      cnt += f[i];
    } else {
      ans += (f[i] > 0);
    }
  }
  cout << ans - cnt << " " << ans << endl;
}
