#include <bits/stdc++.h>
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (long long i = 0; i < (n); ++i) {
    int b;
    cin >> b;
    b /= 400;
    a[i] = b;
  }
  sort((a).begin(), (a).end());
  int ans = 1;
  int cnt = 0;
  for (long long i = 0; i < (n - 1); ++i) {
    if (a[i] <= 7) {
      if (a[i] != a[i + 1]) ans++;
    } else
      cnt++;
  }
  if (a[n - 1] >= 8) cnt++;
  cout << ans << " " << ans + cnt << endl;
}
