#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MOD = 1e9 + 7;
template <class T>
class my_array {
 private:
  int n;
  vector<T> A;

 public:
  my_array(int k) {
    n = k;
    A.resize(n);
  }
  ~my_array(void){};
  void get(void) {
    for (int i = 0; i < n; i++) cin >> A.at(i);
  }
  void sorted(bool flag = true) {
    if (flag)
      sort(A.begin(), A.end());
    else
      sort(A.begin(), A.end(), greater<T>());
  }
  void show(void) {
    for (int i = 0; i < n - 1; i++) cout << A.at(i) << " ";
    cout << A.at(n - 1) << "\n";
  }
  tuple<int, int> solve() {
    vector<int> came(9, 0);
    for (int i = 0; i < n; i++) {
      came[((9 > A.at(i) / 400) ? A.at(i) / 400 : 9)]++;
    }
    int mx, mn, k = 0;
    for (int i = 0; i < 8; i++)
      if (came.at(i) > 0) k++;
    mn = ((1 > k) ? 1 : k);
    mx = k + came.at(8);
    return forward_as_tuple(mn, mx);
  }
};
int main(void) {
  int n;
  cin >> n;
  my_array<int> a(n);
  a.get();
  int p, q;
  tie(p, q) = a.solve();
  cout << p << " " << q << "\n";
  return 0;
}
