#include<bits/stdc++.h>
using namespace std;
int a[100005],n,maxn=0,s=0,b[100005],s2=0;
int main()
{

	while (cin>>a[++s])
	{

		b[s]=1;
		if (a[s]>a[s-1]) s2++;
		for (int j=1;j<s;++j)
		{
			if (a[s]<=a[j])
			b[s]=max(b[s],b[j]+1);
		}
	}
	for (int i=1;i<=s;++i)
	maxn=max(b[i],maxn);
	
	cout<<maxn<<endl<<s2;
	return 0;
	
}