#include <iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int n,a[100005],h[100005]={-100},can[100005],num[100005],cnt,cancnt;
bool b(int a,int b)
{
	return h[a]<h[b];
}
int main() {
    n=0;
	while(cin>>a[n+1])
	{
        n++;
        num[n]=1;
        for(int i=1;i<=n-1;i++)
            if(a[n]<=a[i] && num[i]>=num[n])
                num[n]=num[i]+1;
	}
	int ans=-1;
	for(int i=1;i<=n;i++)
	{
        if(num[i]>ans)
            ans=num[i];
		cancnt=0;
		for(int j=1;j<=cnt;j++)
		{
			if(h[j]>=a[i])
			{
				cancnt++;
				can[cancnt]=j;
			}
		}
		if(cancnt==0)
		{
			cnt++;
			h[cnt]=a[i];
		}
		else
		{
			sort(can+1,can+cancnt+1,b);
			h[can[1]]=a[i];
		}
	}
	cout<<ans<<endl;
	cout<<cnt;
    return 0;
}