#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n;
    cin>>n;
    int a[n];
    int mn = 1e9;
    int mx = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        mn = min(mn, a[i]);
        mx = max(mx, a[i]);
    }
    if (mn == mx) {
        if (a[0]/(n-1) == 2) cout << n << ' ' << 0 << endl;
        else cout << 0 << ' ' << n << endl;
        return 0;
    }
    int tr = 0;
    int km = 0;
    for (int i : a) {
        if (i == mx) tr++;
        else km++;
    }
    cout << tr << ' ' << km << endl;
    return 0;
}