#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int INF = 1e9;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  int n;
  cin >> n;
  vector<int> a(n), cnt(9);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i] /= 400;
    if (a[i] > 8) a[i] = 8;
    cnt[a[i]]++;
  }
  int num = 0;
  for (int i = 0; i < 8; i++) {
    if (cnt[i] > 0) num++;
  }
  cout << num << " " << num + cnt[8] << endl;
  return 0;
}
