#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

int N;
int a[55];

int main(){
    cin >> N;
    REP(i,N) cin >> a[i];

    for(int i = 0; i <= N; i++){
        int j = N-i;
        bool f = true;
        int p1 = 0, p2 = 0;
        REP(k,N){
            if((i>0&&(i-1)*2+j*4 == a[k])){
                p1++;
            } else if((j>0&&(i*2+(j-1)*4 == a[k]))){
                p2++;
            } else {
                f = false; break;
            }
        }
        if(f && i == p1 && j == p2){
            cout << i << " " << j << endl;
            return 0;
        }
    }

    return 0;
}