#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
inline void chmin(T &t, U f) {
  if (t > f) t = f;
}
template <class T, class U>
inline void chmax(T &t, U f) {
  if (t < f) t = f;
}
int n, m, v, i;
void solve() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  vector<int> v(n);
  for (int i = (int)(0); i < (int)(n); i++) {
    cin >> v[i];
  }
  int ans = 0;
  map<int, int> rate;
  for (int i = (int)(0); i < (int)(n); i++) {
    if (v[i] >= 3200) {
      ans++;
      continue;
    }
    rate.insert(make_pair(v[i] / 400, v[i] / 400));
  }
  cout << rate.size() << " ";
  if (rate.size() + ans >= 8)
    cout << 8 << endl;
  else
    cout << rate.size() + ans << endl;
}
int main() {
  solve();
  return 0;
}
