#include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1e9;
constexpr long long BIGINF = 1e18;
constexpr double EPS = 1e-16;
constexpr int MOD = 1e9 + 7;
void preambule() {
  cin.tie(0);
  cout.precision(16);
  cout << fixed;
}
int n;
vector<int> a;
static const vector<int> b = {399, 799, 1199, 1599, 1999, 2399, 2799, 3199};
void input() {
  cin >> n;
  a.resize(n);
  for (auto&& i : a) {
    cin >> i;
  }
}
void solve() {
  vector<int> cnt(b.size());
  int flag = 0;
  for (int i = 0; i < n; ++i) {
    if (a[i] > b.back()) {
      ++flag;
      continue;
    }
    int idx = upper_bound(b.cbegin(), b.cend(), a[i]) - b.cbegin();
    cnt[idx]++;
  }
  int cntzero = 0;
  int cntone = 0;
  for (auto&& i : cnt) {
    cntzero += i == 0;
    cntone += i > 0;
  }
  int ans1 = cntone;
  int ans2 = cntone;
  if (flag) {
    if (cntone == 0) {
      ans1 = 1;
      ans2 = min(flag, (int)b.size());
    } else {
      ans2 += min(flag, cntzero);
    }
  }
  cout << ans1 << ' ' << ans2 << '\n';
}
int main() {
  preambule();
  int t = 1;
  while (t--) {
    input();
    solve();
  }
}
