#include <iostream>
#include <vector>
#include <bitset>

using namespace std;

int main() {
    int n;
    cin >> n;
    bitset<1> kameflag;
    int count{0};
    vector<int> v;
    for (int i = 0; i < n; ++i) {
        int p;
        cin >> p;
        v.push_back(p);
        if (v.at(0) < v.at(i)) kameflag.set();
        else if (v.at(0) == v.at(i)) {
            if (v.size() == n && v.at(0) / (static_cast<int>(v.size()) - 1) == 4) kameflag.set();
            count++;
        }
    }
    if (kameflag.test(0) == true) {
        cout << static_cast<int>(v.size()) - count << " " << count << endl;
    } else {
        cout << count << " " << static_cast<int>(v.size()) - count <<endl;
    }
    return 0;
}