#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
const int N = 1000005;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  int a[n + 1];
  map<int, bool> m;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] >= 1 and a[i] <= 399)
      m[1] = true;
    else if (a[i] > 399 and a[i] <= 799)
      m[2] = true;
    else if (a[i] > 799 and a[i] <= 1199)
      m[3] = true;
    else if (a[i] > 1199 and a[i] <= 1599)
      m[4] = true;
    else if (a[i] > 1599 and a[i] <= 1999)
      m[5] = true;
    else if (a[i] > 1999 and a[i] <= 2399)
      m[6] = true;
    else if (a[i] > 2399 and a[i] <= 2799)
      m[7] = true;
    else if (a[i] > 2799 and a[i] <= 3199)
      m[8] = true;
    else
      cnt++;
  }
  int mn = m.size();
  if (mn == 0) mn = 1;
  int mx = mn;
  mx = min(mx + cnt, 8);
  cout << mn << " " << mx;
  return 0;
}
