import java.util.*;
public class Tsurukame {
	public static void main(String[] arg){
		Scanner sc = new Scanner(System.in);
		int n,tsuru,kame,sum,temp,flag;
		n = sc.nextInt();
		int[] leg = new int[n];
		for(int i = 0;i<n;i++){
			leg[i] = sc.nextInt();
		}
		sum = leg[0];
		kame = (sum - 2*(n-1))/2;
		tsuru = n - kame -1;
		if( kame == n-1 || tsuru == n - 1){
			if ( leg[0] - leg[1] == 0){
				if(kame>0){
					kame++;
				}else{
					tsuru++;
				}
			}else{
				if(kame>0){
					tsuru++;
				}else{
					kame++;
				}
			}
		}else{
			int j = 0;
			while(j<n){
				if(leg[j] != leg[j+1])break;
				j++;
			}
			if(leg[j] - leg[j+1] == 2){
				tsuru++;
			}else{
				kame++;
			}	
		}
		System.out.println(tsuru+" "+kame);
	}
}