//  Created by conan1024hao in 2019.
//  Copyright © 2019 conan1024hao. All rights reserved.
//  専用ライブラリです、自由にコピーして構いません。
//  感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define INF 10e16
#define MOD 1000000007
#define  mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
//using Int=int_fast64_t;
typedef long long int ll;
typedef pair<ll,ll>Pll;
typedef pair<int,int>Pin;
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b)  {return a/GCD(a,b)*b;}
int dx[8]={-1,0,1,0,1,1,-1,-1};
int dy[8]={0,-1,0,1,1,-1,1,-1};
char dir[4]={'u','l','d','r'};
ll cmp1(pair<ll,string>a,pair<ll,string> b){
        if(a.fi!=b.fi)
        return a.fi<b.fi;
        else
        return a.se<b.se;
}
//--------------------------------------------------------------------------


//---------------------------------------------------------------------------
int main(){//問題をちゃんと見ろ!!!!!!!!!!!!!!!!!      llか??????????        memset()!!!!!!!!!!!!       ペナを減らせ!!!!!!!!!!!!!
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------
    int n;cin>>n;
    vector<int>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    map<int,int>m;int cc=0;
    for(int i=0;i<n;i++){
        if(a[i]<=399&&m[1]==0)
            m[1]=1;
        else if(a[i]<=799&&a[i]>=400&&m[2]==0)
            m[2]=1;
        else if(a[i]<=1199&&a[i]>=800&&m[3]==0)
        m[3]=1;
        else if(a[i]<=1599&&a[i]>=1200&&m[4]==0)
        m[4]=1;
        else if(a[i]<=1999&&a[i]>=1600&&m[5]==0)
        m[5]=1;
        else if(a[i]<=2399&&a[i]>=2000&&m[6]==0)
        m[6]=1;
        else if(a[i]<=2799&&a[i]>=2400&&m[7]==0)
        m[7]=1;
        else if(a[i]<=3199&&a[i]>=2800&&m[8]==0)
        m[8]=1;
        else if(a[i]>=3200)
            cc++;
    }
    if(cc==n){
        cout<<1<<" "<<c<<endl;
        return 0;
    }
    int cnt=0;
    for(int i=1;i<=8;i++)
        if(m[i]>0)cnt++;
    cout<<cnt<<" "<<cnt+cc<<endl;
    //-------------------------------
    return 0;
}
//---------------------------------------------------------------------------




