#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;
template <typename T>
using pq2 = priority_queue<T>;
template <typename T>
using pq1 = priority_queue<T, vector<T>, greater<T>>;
int main() {
  int N;
  cin >> N;
  set<int> s, ss;
  for (int i = 0; i < (N); i++) {
    int a;
    cin >> a;
    for (int j = 400; j <= 3200; j += 400) {
      if (a < j && a >= j - 400) s.insert(j), ss.insert(j);
    }
    if (a >= 3200) s.insert(i);
  }
  cout << ss.size() << " " << s.size() << endl;
  return 0;
}
