#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
pii solve() {
  ll N, a;
  cin >> N;
  vector<ll> r{1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
  vector<ll> n(r.size());
  for (int i = 0; i < N; i++) {
    cin >> a;
    int j = 0;
    while (j < r.size() - 1 && r[j + 1] <= a) j++;
    n[j]++;
  }
  ll ans = 0;
  for (int i = 0; i < r.size() - 1; i++) {
    if (n[i] > 0) ans++;
  }
  return pii(ans, ans + n.back());
}
int main() {
  auto ans = solve();
  cout << ans.first << " " << ans.second << "\n";
  return 0;
}
