#include <cstdlib>
#include <algorithm>
#include <array>
#include <iostream>


int
main()
{
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  int n;
  std::cin >> n;

  std::array<bool, 8> group;
  std::fill(std::begin(group), std::end(group), false);
  int cnt2 = 0;
  for (int i = 0; i < n; i++) {
    int a;
    std::cin >> a;
    auto idx = a / 400;
    if (idx < group.size()) {
      group[idx] = true;
    } else {
      cnt2++;
    }
  }
  auto cnt1 = std::count(std::cbegin(group), std::cend(group), true);
  if (cnt1 == 0) {
    auto min = 1;
    auto max = cnt2;
    std::cout << 1 << " " << max << std::endl;
  } else {
    auto min = cnt1;
    auto max = std::min(group.size(), static_cast<std::size_t>(cnt1 + cnt2));
    std::cout << min << " " << max << std::endl;
  }

  return EXIT_SUCCESS;
}
