#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) a[i] /= 400;
  sort(a, a + n);
  int f = a + n - lower_bound(a, a + n, 8);
  int res = 0;
  for (int i = 0; i < 8; i++) {
    res += binary_search(a, a + n, i);
  }
  cout << res << " " << res + f << "\n";
  return 0;
}
