#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long INF = (1LL << 62);
const double inf = pow(10, 10);
double pi = 3.141592653589793;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const long long MOD = 1000000007;
void init() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
}
long long N, A, B;
vector<long long> h(100005);
bool isOK(long long mid) {
  long long ret = 0;
  for (int i = 0; i < N; i++) {
    if (h[i] - mid * B > 0) {
      ret += (h[i] - mid * B + (A - B) - 1) / (A - B);
    }
  }
  return ret <= mid;
}
int main() {
  init();
  long long N;
  cin >> N;
  vector<long long> A(N);
  set<long long> set;
  long long num = 0;
  for (int i = 0; i < N; i++) {
    cin >> A[i];
    if (A[i] >= 3200)
      num++;
    else
      set.insert(A[i] / 400);
  }
  cout << set.size() << endl;
  cout << set.size() + num << endl;
}
