#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+10;
ll a[N];
ll f[N];
ll ans=-1,x,n;
int main(){
while(cin>>x)a[++n]=x;
memset(f,1,sizeof(f));
for(ll i=1;i<=n;i++){
for(ll j=1;j<i;j++){
if(a[j]>=a[i])f[i]=max(f[i],f[j]+1);
}
ans=max(ans,f[i]);
}
cout<<ans<<'\n';
ans=-1;
memset(f,1,sizeof(f));
for(ll i=1;i<=n;i++){
for(ll j=1;j<i;j++){
if(a[j]<a[i])f[i]=max(f[i],f[j]+1);
}
ans=max(ans,f[i]);
}
cout<<ans;
return 0;
}