#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int dy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
char dir[4] = {'u', 'l', 'd', 'r'};
long long int cmp1(pair<long long int, string> a,
                   pair<long long int, string> b) {
  if (a.first != b.first)
    return a.first < b.first;
  else
    return a.second < b.second;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  map<int, int> m;
  int cc = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] <= 399 && m[1] == 0)
      m[1] = 1;
    else if (a[i] <= 799 && a[i] >= 400 && m[2] == 0)
      m[2] = 1;
    else if (a[i] <= 1199 && a[i] >= 800 && m[3] == 0)
      m[3] = 1;
    else if (a[i] <= 1599 && a[i] >= 1200 && m[4] == 0)
      m[4] = 1;
    else if (a[i] <= 1999 && a[i] >= 1600 && m[5] == 0)
      m[5] = 1;
    else if (a[i] <= 2399 && a[i] >= 2000 && m[6] == 0)
      m[6] = 1;
    else if (a[i] <= 2799 && a[i] >= 2400 && m[7] == 0)
      m[7] = 1;
    else if (a[i] <= 3199 && a[i] >= 2800 && m[8] == 0)
      m[8] = 1;
    else if (a[i] >= 3200)
      cc++;
  }
  int cnt = 0;
  for (int i = 1; i <= 8; i++)
    if (m[i] > 0) cnt++;
  cout << cnt << " " << cnt + min(cc, 9 - cnt) << endl;
  return 0;
}
