#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll, ll>>>;
const int mod = 1000000007;
int main() {
  int N;
  cin >> N;
  int sil = 0;
  map<int, int> m;
  for (ll i = 0; i < (ll)(N); i++) {
    int a;
    cin >> a;
    if (a < 3200) {
      m[a / 400]++;
    } else {
      sil++;
    }
  }
  if (sil > 0) {
    cout << max(1, (int)m.size()) << " " << min(8, (int)m.size() + sil) << endl;
  } else {
    cout << m.size() << " " << m.size() << endl;
  }
  return 0;
}
