#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>

#define rep(i,n) for(i=0;i<(n);i++)
using namespace std;

int main() {
    int n,min=0,max=0,f[9]={0},i;
    cin>>n;
    int a[n];
    rep(i,n){
    	
    	cin>>a[i];
    	
    	if(a[i]<=399){
    		f[0]=1;
    	}
    	else if( a[i]<=799){
    		f[1]=1;
    	}
    	else if(a[i]<=1199){
    	    f[2]=1;
    	}
    	else if(a[i]<=1599){
    	    f[3]=1;
    	}
    	else if(a[i]<=1999){
    	    f[4]=1;
    	}
    	else if(a[i]<=2399){
    	    f[5]=1;
    	}
    	else if(a[i]<=2799){
    	    f[6]=1;
    	}
    	else if(a[i]<=3199){
    	    f[7]=1;
    	}
    	else{
    		f[8]++;
    	}
    }
    rep(i,9){
    		if(i!=8){
    		  min+=f[i];
    		  max+=f[i];
    		}
    		else{
    			max=min+f[8];
    			if(min==0 && any>0){
    				min=1;
    				max=f[8];
    			}
    		}
    }
    cout<<min<<" "<<max<<endl;
	// your code goes here
	return 0;
}