#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
const ll mod = 1e9 + 7;
const int INF = (1 << 30) - 1;
const ll INFLL = (1LL << 62) - 1;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
  int n;
  cin >> n;
  vi a(n);
  for (int i = (0); i < ((n)); ++i) cin >> a[i];
  set<int> s;
  int free = 0;
  for (int i = (0); i < ((n)); ++i) {
    if (1 <= a[i] && a[i] <= 399)
      s.insert(0);
    else if (a[i] <= 799)
      s.insert(1);
    else if (a[i] <= 1199)
      s.insert(2);
    else if (a[i] <= 1599)
      s.insert(3);
    else if (a[i] <= 1999)
      s.insert(4);
    else if (a[i] <= 2399)
      s.insert(5);
    else if (a[i] <= 2799)
      s.insert(6);
    else if (a[i] <= 3199)
      s.insert(7);
    else
      free++;
  }
  int v_min, v_max;
  v_min = min((int)s.size(), 8);
  v_max = (int)s.size() + free;
  cout << v_min << " " << v_max << endl;
}
