#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int a[n];
    rep(i,n)cin >> a[i];
    sort(a,a+n);

    if(a[0] == a[n-1]){
        if(a[0] / 2 == n - 1)cout << n << ' ' << 0 << endl;
        else cout << 0 << ' ' << n << endl;
        return 0;
    }

    int x = a[0] + 4;

    rep(i,1000){
        int j = n - i;
        if(i * 2 + j * 4 == x){
            cout << i << ' ' << j << endl;
            return 0;
        }
    }

    return 0;
}