#include<iostream>
#include<cstdio>
using namespace std;

int a[100005],n,f1[100005],f2[100005],maxn,minn;
int times;
int main(){
	while(scanf("%d",&a[++n])){
		if(cin.get()=='\n')break;
	}
	for(int i=1;i<=n;i++){
		f1[i]=1;
		f2[i]=1;
		for(int j=1;j<i;j++){
			if(a[j]>=a[i]){
				f1[i]=max(f1[j]+1,f1[i]);
			}
			if(a[j]<a[i]){
				f2[i]=max(f2[j]+1,f2[i]);
			}
		}
		maxn=max(maxn,f1[i]);
		minn=max(minn,f2[i]);
	}
	cout<<maxn<<endl<<minn;
	return 0;
}