#include <bits/stdc++.h>
using namespace std;
void solve(int N, vector<int> a) {
  unordered_map<int, int> rate(8);
  for (int i = 0; i < N; ++i) rate[min(a[i] / 400, 8)]++;
  int num = 0;
  for (int i = 0; i < 8; ++i)
    if (rate[i]) num++;
  int wildcard = rate[8];
  cout << num << " " << min(8, num + wildcard) << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < N; ++i) cin >> a[i];
  solve(N, move(a));
  return 0;
}
