#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = (int)2e5 + 5;
int cnt[8], x = 0;
void solve() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i] <= 399)
      cnt[0]++;
    else if (a[i] <= 799)
      cnt[1]++;
    else if (a[i] <= 1199)
      cnt[2]++;
    else if (a[i] <= 1599)
      cnt[3]++;
    else if (a[i] <= 1999)
      cnt[4]++;
    else if (a[i] <= 2399)
      cnt[5]++;
    else if (a[i] <= 2799)
      cnt[6]++;
    else if (a[i] <= 3199)
      cnt[7]++;
    else
      x++;
  }
  sort(cnt, cnt + 8);
  int ans = 0;
  for (int i = 0; i < 8; ++i) {
    if (cnt[i] > 0) ans++;
  }
  cout << ans << " " << min(8, ans + x);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
