#include<bits/stdc++.h>
using namespace std;
int high[30],dp[30]={0,1,0},ans,temp,n;
int main()
{
while(cin>>temp)
n++,high[n]=temp;
for(int i=2;i<=n;i++)
{
ans=dp[i];
for(int j=1;j<i;j++)
if(high[i]<high[j])
ans=max(ans,dp[j]);
dp[i]=ans+1;
}
ans=0;
for(int i=1;i<=n;i++)
ans=max(ans,dp[i]);
cout<<ans<<endl;
memset(dp,0,sizeof(dp));
dp[1]=1;
for(int i=2;i<=n;i++)
{
ans=dp[i];
for(int j=1;j<i;j++)
if(high[i]>high[j])
ans=max(ans,dp[j]);
dp[i]=ans+1;
}
ans=0;
for(int i=1;i<=n;i++)
ans=max(ans,dp[i]);
cout<<ans;
}
using namespace std;
int high[30],dp[30]={0,1,0},ans,temp,n;
int main()
{
while(cin>>temp)
n++,high[n]=temp;
for(int i=2;i<=n;i++)
{
ans=dp[i];
for(int j=1;j<i;j++)
if(high[i]<high[j])
ans=max(ans,dp[j]);
dp[i]=ans+1;
}
ans=0;
for(int i=1;i<=n;i++)
ans=max(ans,dp[i]);
cout<<ans<<endl;
memset(dp,0,sizeof(dp));
dp[1]=1;
for(int i=2;i<=n;i++)
{
ans=dp[i];
for(int j=1;j<i;j++)
if(high[i]>high[j])
ans=max(ans,dp[j]);
dp[i]=ans+1;
}
ans=0;
for(int i=1;i<=n;i++)
ans=max(ans,dp[i]);
cout<<ans;
}