#include <vector>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i,n) for(int i=0;i<n;i++)
#define SORT(c) sort((c).begin(),(c).end())
#define ALL(a) (a).begin(),(a).end()

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  int freedom = 0;
  bool colors[8];
  REP(i, 8) {
    colors[i] = false;
  }
  bool hai = false;
  bool cha = false;
  bool midori = false;
  bool mizu = false;
  bool ao = false;
  bool ki = false;
  bool dai = false;
  bool aka = false;

  REP(i, n) {
    int tmp;
    cin >> tmp;
    if(tmp <= 399) {
      colors[0] = true;
    } else if(tmp <= 799) {
      colors[1] = true;
    } else if(tmp <= 1199) {
      colors[2] = true;
    } else if(tmp <= 1599) {
      colors[3] = true;
    } else if(tmp <= 1999) {
      colors[4] = true;
    } else if(tmp <= 2399) {
      colors[5] = true;
    } else if(tmp <= 2799) {
      colors[6] = true;
    } else if(tmp <= 3199) {
      colors[7] = true;
    } else {
      freedom++;
    }
  }

  int colorsCount = 0;
  REP(i, 8) {
    if(colors[i]) {
      colorsCount++;
    }
  }

  int maxAns = colorsCount + freedom;
  if(maxAns > 8) {
    maxAns = 8;
  }
  cout << colorsCountm << " " << axAns << endl;
  return 0;
}
