#include <bits/stdc++.h>
using namespace std;
typedef std::priority_queue<int> IntPrioQueue;
typedef std::priority_queue<int, std::vector<int>, std::greater<int> >
    IntReversePrioQueue;
const int MAX = 200000;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1 << 29;
const int MOD = 1000000007;
int rate[10], red;
void solve(void) {
  int N;
  cin >> N;
  for (int i = 0; i <= N - 1; i++) {
    int A;
    cin >> A;
    if (A >= 3200)
      red++;
    else
      (rate[A / 400]++);
  }
  int ans = 0;
  for (int e = 0; e <= 8 - 1; e++)
    if (rate[e]) ans++;
  cout << ans << ' ' << ans + red << '\n';
}
int main(void) {
  solve();
  return 0;
}
