#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int mod = 1e9+7;

int N;
int a[55];
int kame, tsuru;
int main(){
    cin>>N;
    REP(i, 0, N){
        cin>>a[i];
    }
    sort(a, a+N);
    int cnt=-1;
    REP(i,0,N){
        if(a[i]!=a[0]){
            cnt=i;
            break;
        }
    }
    if(cnt==-1){
        if(a[0]==4*(N-1)){
            cout<<0<<" "<<N<<endl;
        }else{
            cout<<N<<" "<<0<<endl;
        }
    }else{
        cout<<N-cnt<<" "<<cnt<<endl;
    }

    return 0;
}