#include<algorithm>
#include <iostream>
#include <climits>
#include <vector>

int main() {
    int n=0;
    std::cin>>n;

    std::vector<int> lcc(n);
    for(int i=0; i<n; ++i) {
        int lc = 0;
        std::cin>>lc;
        lcc[i] = lc;
    }

    std::sort(std::begin(lcc), std::end(lcc));
    auto itr = std::find_if(std::begin(lcc), std::end(lcc), [&lcc](int n) {
            return n!=lcc[0];
            }
            );
    if(itr ==std::end(lcc)) {
        if(lcc[0] == (n-1)*2) {
            std::cout<<n<<" "<<0<<std::endl;
            return 0;
        }
        std::cout<<0<<" "<<n<<std::endl;
        return 0;
    }
    std::cout<<(itr-std::begin(lcc))<<" "<<(std::end(lcc)-itr)<<std::endl;
}