#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9 + 7;



int main(){
    int n;
    cin >> n;
    map<int, int> m;
    rep(i, n){
        int x;
        cin >> x;
        m[x]++;
    }

    if(m.size() == 1){
        auto p = *m.begin();
        if(p.first/(n-1) == 2) cout << p.second << " " << 0 << endl;
        else cout << 0 << " " << p.second << endl;
    }
    else{
        auto a = *m.begin();
        auto b = *(++m.begin());
        if(a.first > b.first) cout << a.second << " " << b.second << endl;
        else cout << b.second << " " << a.second << endl;
    }
}