#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
#include<set>
#include<bitset>
#include<math.h>
#include<map>
#include<queue>
#include<iomanip>
using namespace std;

int main(){
    int n, cnt;
    set<int> st;
    cin >> n;
    for (int i = 0; i < n; i++){
        int temp;
        cin >> temp;
        st.insert(temp);
    }
    if (st.size() == 1 && (*st.begin() == (n-1)*4)) cout << 0 << " " << n << endl;
    else if (st.size() == 1 && (*st.begin() == (n-1)*2)) cout << n << " " << 0 << endl;
    else cout << 2*n - (*st.begin() + 4)/2 << " " << (*st.begin() + 4)/2 - n << endl;
}