WAWAWAWAWAWA

#include<bits/stdc++.h>
using namespace std;
int n,a[1002],b[1002],c,t,st;
bool tk(int b[]){
	for(int i=1;i<=n;i++)
		if(b[i]!=0) return true;
	return false;
}
int main(){
	freopen("1.in","r",stdin);
	freopen("1.out","w",stdout);
	ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
	while(cin>>t){n++;a[n]=t;}
	for(int i=1;i<=n;i++){
		a[0]=1;
		for(int j=1;j<i;j++)
			if(a[i]<=a[j])
				a[0]=max(a[0],b[j]+1);
		b[i]=a[0];
	}
	for(int i=1;i<=n;i++){
		b[0]=max(b[0],b[i]);
//		cout<<b[i]<<" ";
	}
//	cout<<"\n";
	cout<<b[0]<<"\n";
	//最长下降子序列
	sort(b+1,b+1+n);
	while(tk(b)){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++)
				if(b[j]==i){b[j]=0;break;}
		}
		sort(b+1,b+1+n);
//		for(int i=1;i<=n;i++)
//			cout<<b[i]<<" ";
		st++;
	}
	cout<<st;
	return 0;
}