#define _GLIBCXX_DEBUG
#define ll long long
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;

int main(){
  int N; cin >> N;
  vector<int> A(N);
  for(int i = 0; i < N; i++) cin >> A[i];
  sort(A.begin(), A.end());
  if(A[0] == A[N-1]){
    if(A[0] == N*2-2){
      cout << N << " 0" << endl;
    }else{
      cout << "0 " << N << endl;
    }
  }else{
    for(int i = 1; i < N; i++){
      if(A[0] != A[i]){
        cout << N-i << " " << i << endl;
        break;
      }
    }
  }
}