#include <bits/stdc++.h>
using namespace std;
int a[500000], b[50];
int main() {
  int n, i;
  memset(b, 0, sizeof(b));
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (i = 1; i < n; i++)
    if (a[i] != a[i + 1])
      if (a[i] >= 1 && a[i] <= 399)
        b[1]++;
      else if (a[i] >= 400 && a[i] <= 799)
        b[2]++;
      else if (a[i] >= 800 && a[i] <= 1199)
        b[3]++;
      else if (a[i] >= 1200 && a[i] <= 1599)
        b[4]++;
      else if (a[i] >= 1600 && a[i] <= 1999)
        b[5]++;
      else if (a[i] >= 2000 && a[i] <= 2399)
        b[6]++;
      else if (a[i] >= 2400 && a[i] <= 2799)
        b[7]++;
      else if (a[i] >= 2800 && a[i] <= 3199)
        b[8]++;
  int s = 0;
  for (i = 1; i <= 8; i++)
    if (b[i] != 0) s++;
  sort(b + 1, b + s + 1);
  cout << s << ' ' << b[s] << endl;
  return 0;
}
