#include <bits/stdc++.h>
using namespace std;
const long long INF = 9223372036854775806;
namespace G {}
long long rate[] = {399, 799, 1199, 1599, 2399, 2799, 3199};
long long map[8]{0};
long long solve(long long n) {
  if (n <= 399)
    return 0;
  else if (n <= 799)
    return 1;
  else if (n <= 1199)
    return 2;
  else if (n <= 1599)
    return 3;
  else if (n <= 2399)
    return 4;
  else if (n <= 2799)
    return 5;
  else if (n <= 3199)
    return 6;
  else
    return 7;
}
signed main() {
  long long ans = 0;
  long long n;
  cin >> n;
  for (long long i = 0; i < n; ++i) {
    long long ngo;
    long long index;
    cin >> ngo;
    index = solve(ngo);
    if ((map[index] == 0) && (index != 7)) {
      ans += 1;
      map[index] = 1;
    } else if (index == 7) {
      ans += 1;
      map[index] += 1;
    }
  }
  if (ans - map[7] == 0)
    cout << 1 << " " << ans << endl;
  else
    cout << ans - map[7] << " " << ans << endl;
  return 0;
}
