#include <bits/stdc++.h>
using namespace std;
int n, a[10005], b[10005], u, v, cnt = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  b[0] = 0;
  b[1] = 399;
  b[2] = 799;
  b[3] = 1199;
  b[4] = 1599;
  b[5] = 1999;
  b[6] = 2399;
  b[7] = 2799;
  b[8] = 3199;
  for (int i = 1; i <= 8; i++) {
    u = upper_bound(a + 1, a + n + 1, b[i - 1]) - a;
    v = upper_bound(a + 1, a + n + 1, b[i]) - a;
    if (v - u > 0) cnt++;
  }
  cout << cnt << " " << cnt + (n - v + 1);
}
