#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const double EPS = 1e-10;
double zero(double d) { return abs(d) < EPS ? 0.0 : d; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << '(' << p.first << ',' << p.second << ')';
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
  os << '[';
  for (int i = 0; i < (int)(a.size()); i++) os << (i ? " " : "") << a[i];
  return os << ']';
}
string toString(int i) {
  stringstream ss;
  ss << i;
  return ss.str();
}
const int MOD = 1000000007;
long long fpow(long long a, long long k, int M) {
  long long res = 1ll;
  long long x = a;
  while (k != 0) {
    if ((k & 1) == 1) res = (res * x) % M;
    x = (x * x) % M;
    k >>= 1;
  }
  return res;
}
struct prepare {
  prepare() {
    cout.setf(ios::fixed, ios::floatfield);
    cout.precision(8);
    ios_base::sync_with_stdio(false);
  }
} _prepare;
bool solve() {
  vector<int> rates = {3200, 2800, 2400, 2000, 1600, 1200, 800, 400, -1};
  int N;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < (int)(N); i++) cin >> a[i];
  vector<int> count(rates.size(), 0);
  for (int i = 0; i < (int)(N); i++) {
    for (int j = 0; j < (int)(rates.size()); j++) {
      if (a[i] >= rates[j]) {
        count[j]++;
        break;
      }
    }
  }
  int num = 0;
  for (int i = 1; i < (int)(rates.size()); i++) {
    if (count[i] > 0) num++;
  }
  int mxnum = min((int)rates.size() - 1, num + count[0]);
  cout << num << " " << mxnum << endl;
}
int main() {
  auto res = solve();
  return 0;
}
