#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const long long LINF = 1e11;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void solve() {
  int n;
  cin >> n;
  vector<int> a = vector<int>(n, 0);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int freeCnt = 0;
  set<int> colors;
  for (int i = 0; i < n; ++i) {
    if (3200 <= a[i]) {
      freeCnt++;
      continue;
    }
    colors.insert(a[i] / 400);
  }
  cout << colors.size() << " " << colors.size() + freeCnt << "\n";
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}
