#include <limits>
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;

template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, p = 0;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; ++i) {
        int k;
        cin >> k;
        p += k;
        v[i] = k;
    }
    p /= (n-1);
    int a = 0, b = 0;
    for (auto &&i : v) {
        if(i == p-2) a++;
        else b++;
    }
    printf("%d %d", a, b);
    return 0;
}