#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
int main() {
  int n;
  cin >> n;
  int pro = 0;
  vector<int> q(8, 0);
  vector<int> p(n);
  for (int i = 0; i < (int)(n); i++) {
    cin >> p[i];
    if (p[i] <= 399)
      q[0]++;
    else if (p[i] <= 799)
      q[1]++;
    else if (p[i] <= 1199)
      q[2]++;
    else if (p[i] <= 1599)
      q[3]++;
    else if (p[i] <= 1999)
      q[4]++;
    else if (p[i] <= 2399)
      q[5]++;
    else if (p[i] <= 2799)
      q[6]++;
    else if (p[i] <= 3199)
      q[7]++;
    else
      pro++;
  }
  int ans = 0;
  for (int i = 0; i < (int)(8); i++) {
    if (q[i] != 0) ans++;
  }
  if (ans == 0) ans++;
  cout << ans << " " << ans + pro << endl;
}
