#include <iostream>
#include <cstdio>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstring>
#include <algorithm>
using namespace std;
int n=1,a[1001],dp_up[1001],dp_down[1001]; 
int main()
{
	while(cin>>a[n]){
		dp_up[n]=1,dp_down[n++]=1;
	}
	n--;
	int maxx_down=1,maxx_up=1;
	for(int i=2;i<=n;i++){
		for(int j=1;j<i;j++){
			if(a[i]<=a[j]) dp_down[i] = max(dp_down[i],dp_down[j]+1);
			if(a[i] > a[j]) dp_up[i]=max(dp_up[i],dp_up[j]+1);
		}
		maxx_down = max(maxx_down,dp_down[i]);
		maxx_up = max(maxx_up,dp_up[i]);
	}
	cout<<maxx_down<<endl<<maxx_up;
}