#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000000 + 7;
long long int ceil1(long long int n, long long int m) {
  if (n % m == 0) {
    return n / m;
  }
  return n / m + 1;
}
long long int factor(long long int n) {
  vector<long long int> ans;
  if (n == 2)
    ans.push_back(2);
  else {
    for (long long int i = 2; i * i <= n; i++) {
      if (n % i == 0 && n % i != i) {
        ans.push_back(i);
        if (n / i != i) ans.push_back(n / i);
      }
    }
    ans.push_back(n);
  }
  return ans.size() + 1;
}
long long int fact(long long int n) {
  long long int res = 1;
  for (long long int i = 2; i <= n; i++) res = res * i;
  return res;
}
long long int nCr(long long int n, long long int r) {
  return fact(n) / (fact(r) * fact(n - r));
}
void dfs(vector<vector<long long int>> &v, long long int k,
         vector<long long int> &par, vector<long long int> &dis,
         long long int p) {
  par[k] = p;
  dis[k] = dis[p] + 1;
  for (long long int i = 0; i < v[k].size(); i++) {
    if (v[k][i] != p) {
      dfs(v, v[k][i], par, dis, k);
    }
  }
}
bool sortbysec(const pair<string, int> &a, const pair<string, int> &b) {
  return (a.second < b.second);
}
long long int pow2(long long int n, long long int k) {
  long long int ans = 1;
  while (k > 0) {
    if (k % 2 == 1) ans = ans * n;
    n = n * n;
    k /= 2;
  }
  return ans;
}
bool prime(int n) {
  int i, j;
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) cin >> a[i];
  long long int c1 = 0, c2 = 0, c3 = 0, c4 = 0, c5 = 0, c6 = 0, c7 = 0, c8 = 0,
                c9 = 0;
  for (long long int i = 0; i < n; i++) {
    if (a[i] <= 399)
      c1++;
    else if (a[i] <= 799)
      c2++;
    else if (a[i] <= 1199)
      c3++;
    else if (a[i] <= 1599)
      c4++;
    else if (a[i] <= 1999)
      c5++;
    else if (a[i] <= 2399)
      c6++;
    else if (a[i] <= 2799)
      c7++;
    else if (a[i] <= 3199)
      c8++;
    else
      c9++;
  }
  long long int mx = min(1ll, c1) + min(1ll, c2) + min(1ll, c3) + min(1ll, c4) +
                     min(1ll, c5) + min(1ll, c6) + min(1ll, c7) + min(1ll, c8);
  cout << mx << " " << mx + c9;
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int q;
  q = 1;
  while (q--) {
    solve();
  }
  return 0;
}
