#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1010;
int n,ans=0,c[maxn],a[maxn];

int Binary_search1(int x){
	int l=0,r=ans,mid;
	while(l<=r){
		mid=(l+r)>>1;
		if(c[mid]>=x)l=mid+1;
		else r=mid-1;
	}
	return l;
}

int Binary_search2(int x){
	int l=0,r=ans,mid;
	while(l<=r){
		mid=(l+r)>>1;
		if(c[mid]<x)l=mid+1;
		else r=mid-1;
	}
	return l;
}

int main()
{
    freopen("missile.in","r",stdin);
    freopen("missile.out","w",stdout);
	while((scanf("%d",&a[++n]))!=EOF);n--;
	c[0]=0x7fffffff;
	for(int i=1;i<=n;i++){
		int tmp=Binary_search1(a[i]);
		if(c[tmp]<a[i])c[tmp]=a[i];
		if(tmp>ans)ans=tmp;
	}
	printf("%d\n",ans);
	memset(c,0x7f,sizeof c);
	c[0]=-1;ans=0;
	for(int i=1;i<=n;i++){
		int tmp=Binary_search2(a[i]);
		if(c[tmp]>a[i])c[tmp]=a[i];
		if(tmp>ans)ans=tmp;
	}
	printf("%d\n",ans);
    return 0;
}