#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, a[100], rank[8] = {0, 0, 0, 0, 0, 0, 0, 0};
  cin >> N;
  int count = 0;
  for (int i = 0; i < N; i++) {
    cin >> a[i];
    for (int j = 0; j < 8; j++) {
      if (400 * i <= a[i] && a[i] < 400 * (i + 1)) rank[j] = 1;
    }
    if (a[i] > 3200) count++;
  }
  int ans1 = 0, ans2;
  for (int i = 0; i < 8; i++) ans1 += rank[i];
  ans2 = min(ans1 + count, 8);
  cout << ans1 << " " << ans2 << endl;
}
