#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
template <class T>
void cout_vec(const vector<T> &vec1) {
  for (long long i = 0; i < long long(vec1.size()); i++) {
    cout << vec1[i] << ' ';
  }
  cout << '\n';
}
template <class T>
T gcd(T a, T b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> cnt(9);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    if (1 <= a[i] && a[i] <= 399) cnt[0]++;
    if (400 <= a[i] && a[i] <= 799) cnt[1]++;
    if (800 <= a[i] && a[i] <= 1199) cnt[2]++;
    if (1200 <= a[i] && a[i] <= 1599) cnt[3]++;
    if (1600 <= a[i] && a[i] <= 1999) cnt[4]++;
    if (2000 <= a[i] && a[i] <= 2399) cnt[5]++;
    if (2400 <= a[i] && a[i] <= 2799) cnt[6]++;
    if (2800 <= a[i] && a[i] <= 3199) cnt[7]++;
    if (3200 <= a[i]) cnt[8]++;
  }
  int a1 = 0, a2 = 0;
  a1 = 8 - count(begin(cnt), begin(cnt) + 8, 0);
  a2 = min(8, a1 + cnt[8]);
  cout << a1 << ' ' << a2 << endl;
}
