#include <bits/stdc++.h>
using namespace std;
template <class T>
void umin(T &a, T b) {
  a = min(a, b);
}
template <class T>
void umax(T &a, T b) {
  a = max(a, b);
}
const int dx[] = {1, 0, -1, 0, -1, -1, 1, 1},
          dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
const int mod = 1e9 + 7;
const int N = 2e6 + 5;
int used[N];
void solve() {
  int n;
  cin >> n;
  int a[n], cnt = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i] >= 3200) cnt++;
    used[a[i] / 400] = 1;
  }
  int res = 0;
  for (int i = 0; i < 8; ++i) {
    if (used[i]) res++;
  }
  cout << res << ' ' << min(8, res + cnt);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) solve();
  return 0;
}
