#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

typedef long long int ll;
using namespace std;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(false);cout.tie(0);cin.tie(0);

typedef tree< pair < ll, ll >, null_type, less< pair < ll, ll > >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const ll mod = 998244353;
const ll MAXN = 1e5+5;
const ll inf = 1e18;

int main()
{
    fastio;
    ll n;
    cin >> n;
    vector < ll > v(8, 0), a(n);
    ll cnt = 0;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        ll b = a[i] / 400;
        if(b < 8) v[b]++;
        else cnt++;
    }
    ll ans = 0;
    for(int i = 0; i < 8; i++){
        if(v[i]) ans++;
    }
    cout << max((ll)1, ans) << " " << min(ans + cnt, (ll)8);
}
