#include <bits/stdc++.h>
using ll = long long;
using itn = int;
using namespace std;
static const long double GRATIO = (long double)(1 + sqrt(5)) / 2;
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;
  vector<int> a(N);
  for (int i = 0; i < int(N); ++i) cin >> a[i];
  vector<int> cnt(9, 0);
  for (int i = 0; i < int(N); ++i) {
    if (a[i] < 400) {
      cnt[0]++;
    } else if (400 <= a[i] && a[i] < 800) {
      cnt[1]++;
    } else if (800 <= a[i] && a[i] < 1200) {
      cnt[2]++;
    } else if (1200 <= a[i] && a[i] < 1600) {
      cnt[3]++;
    } else if (1600 <= a[i] && a[i] < 2000) {
      cnt[4]++;
    } else if (2000 <= a[i] && a[i] < 2400) {
      cnt[5]++;
    } else if (2400 <= a[i] && a[i] < 2800) {
      cnt[6]++;
    } else if (2800 <= a[i] && a[i] < 3200) {
      cnt[7]++;
    } else {
      cnt[8]++;
    }
  }
  int ans = 0;
  for (int i = 0; i < int(8); ++i) {
    if (cnt[i]) ans++;
  }
  cout << ans << " " << ans + cnt[8] << endl;
}
