#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long INF = 200000000;
const int MOD = 1000000007;
long myPow(long long x, long long n, long long m = MOD) {
  if (n == 0) return 1;
  if (n % 2 == 0)
    return myPow(x * x % m, n / 2, m);
  else
    return x * myPow(x, n - 1, m) % m;
}
class Ans {
 public:
  long long x;
  long long y;
  long long x_;
  long long y_;
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  long long N;
  cin >> N;
  vector<long long> v(N);
  long long rednum = 0;
  set<long long> set;
  for (int i = 0; i < N; i++) {
    cin >> v[i];
    if (v[i] >= 3200)
      rednum++;
    else
      set.insert(v[i] / 400);
  }
  cout << max(1LL, (long long)set.size()) << endl;
  cout << min(8LL, (long long)set.size() + rednum) << endl;
}
