#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <cmath>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define MA(i,j) make_pair(i,j)
#define PA pair<int,int>
#define PB push_back
#define PQ priority_queue<int>
#define PGQ priority_queue<int,vector<int>,greater<int> >
#define VE vector<int>
#define VP vector<PA>
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
#define MOD 1000000007
#define INF 1000000007
using namespace std;
//
int main(){
  int N;
  int cnt=0;
  set<int> S;
  cin>>N;
  FOR(i,0,N){
    int A;
    cin>>A;
    if(A>=3200){
      cnt++;
      continue;
    }
    int B=A/400;
    S.insert(B);
  }
  cout<<max(S.size(),1)<<" "<<S.size()+cnt<<endl;
  return 0;
}
