#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>

#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i = 0;i < (n);i++)
#define PI 3.14159265359

using namespace std;

int main(){
    int n,t = 0,k = 0;
    cin >> n;
    vector<int> a(n);
    REP(i, n){
        cin >> a[i];
    }
    sort(ALL(a));
    int count = 1;
    for(int i = 1;i < n;i++){
        if(a[i-1] != a[i])break;
        else count++;
    }
    if(count == n){
        if((n-1)*2 == a[0])t = n;
        else k = n;
    }
    else{
        k = count;
        t = n - count;
    }
    printf("%d %d\n",t,k);
    return 0;
}