#include <bits/stdc++.h>
using namespace std;
void solve() {
  bitset<8> distribution;
  int N;
  cin >> N;
  int a = 0;
  while (N--) {
    int d;
    cin >> d;
    if (d >= 3200) {
      a++;
    } else
      distribution[d / 400] = 1;
  }
  int ans = distribution.count();
  cout << ans << ' ' << ans + a << endl;
}
int main() {
  solve();
  return 0;
}
