#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3], n;
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
int gcd(int a, int b) {
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main() {
  int n;
  cin >> n;
  int a[n + 1];
  for (int i = (0); i < (n); ++i) {
    cin >> a[i];
  }
  int c1 = 0, c2 = 0, c3 = 0, c4 = 0, c5 = 0, c6 = 0, c7 = 0, c8 = 0, c9 = 0,
      sum;
  for (int i = (0); i < (n); ++i) {
    if (a[i] < 400 && c1 == 0) c1++;
    if (a[i] >= 400 && a[i] < 800 && c2 == 0) c2++;
    if (a[i] >= 800 && a[i] < 1200 && c3 == 0) c3++;
    if (a[i] >= 1200 && a[i] < 1600 && c4 == 0) c4++;
    if (a[i] >= 1600 && a[i] < 2000 && c5 == 0) c5++;
    if (a[i] >= 2000 && a[i] < 2400 && c6 == 0) c6++;
    if (a[i] >= 2400 && a[i] < 2800 && c7 == 0) c7++;
    if (a[i] >= 2800 && a[i] < 3200 && c8 == 0) c8++;
    if (a[i] >= 3200) c9++;
    sum = c1 + c2 + c3 + c4 + c5 + c6 + c7 + c8;
  }
  if (c9)
    cout << sum << " " << sum + c9 << endl;
  else
    cout << sum << " " << sum << endl;
}
