#include <cstdio>
#include <climits>
#include <vector>
#include <algorithm>
#include <queue>
#include <stdio.h>
#include <string>


#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 99999999

using namespace std;

int main() {

    int n;
    scanf("%d",&n);
    int a[n];
    
    for(int i = 0; i < n; i++) {
        scanf("%d",&a[i]);
    }
    bool allSame = true;
    for(int i = 1; i < n; i++) {
        if(a[i-1] != a[i]) {
            allSame = false;
            break;
        }
    }
    if(allSame) {
        if(a[0] / (n-1) == 2) {
            printf("%d 0\n",n);
        }
        else {
            printf("0 %d\n",n);
        }
        return 0;
    }
    int a1 = -1;
    int a2 = 0;
    
    int b1 = -1;
    int b2 = 0;
    
    
    for(int i = 0; i < n; i++) {
        if(a1 == a[i]) {
            a2++;
        }
        else if(b1 == a[i]) {
            b2++;
        }
        else if(a2 == 0) {
            a1 = a[i];
            a2++;
        }
        else if(b2 == 0) {
            b1 = a[i];
            b2++;
        }
    }
    
    if(a1 < b1) {
        printf("%d %d\n",b2,a2);
    }
    else {
        printf("%d %d\n",a2,b2);
    }
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
}