#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
const long long INF = numeric_limits<long long>::max();
int main() {
  ll N;
  cin >> N;
  ll free = 0;
  vector<ll> rank(8, 0);
  for (ll i = 0; i < N; ++i) {
    ll n;
    cin >> n;
    if (n >= 3200) {
      free++;
    } else {
      rank[n / 400]++;
    }
  }
  ll sum = 0;
  for (ll i = 0; i < rank.size(); ++i) {
    sum += rank[i] > 0 ? 1 : 0;
  }
  cout << sum << " " << (min(sum + free, (ll)8)) << "\n";
  return 0;
}
