#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = mod * mod;
long long min(long long a, long long b) {
  if (a > b) {
    return b;
  } else {
    return a;
  }
}
long long max(long long a, long long b) {
  if (a > b) {
    return a;
  } else {
    return b;
  }
}
long long power(long long a, long long b) {
  long long ans = 1;
  for (long long i = 1; i <= b; i++) {
    ans *= a;
  }
  return ans;
}
long long gcd(long long m, long long n) {
  if (n == 0) {
    return m;
  }
  return gcd(n, m % n);
}
long long lcm(long long a, long long b) {
  long long g = gcd(a, b);
  return a / gcd(a, b) * b;
}
int main() {
  long long N;
  cin >> N;
  vector<long long> a(N);
  vector<long long> S(9);
  for (long long i = 0; i < (long long)(N); i++) {
    cin >> a[i];
    if (a[i] < 400) {
      S[0]++;
    } else if (a[i] < 800) {
      S[1]++;
    } else if (a[i] < 1200) {
      S[2]++;
    } else if (a[i] < 1600) {
      S[3]++;
    } else if (a[i] < 2000) {
      S[4]++;
    } else if (a[i] < 2400) {
      S[5]++;
    } else if (a[i] < 2800) {
      S[6]++;
    } else if (a[i] < 3200) {
      S[7]++;
    } else {
      S[8]++;
    }
  }
  long long sum = 0;
  for (long long i = 0; i < (long long)(8); i++) {
    if (S[i] > 0) {
      sum++;
    }
  }
  if (sum == 0) {
    cout << 1 << min(8, sum) << endl;
  } else if (sum + S[8] >= 8) {
    cout << sum << " " << 8 << endl;
  } else {
    cout << sum << " " << sum + S[8] << endl;
  }
}
