struct cmp1{bool operator()(int a,int b){return a>b;}};

int main()

{

    while(cin>>a[++n]);

    n--;

    if(n==)

    {

        cout<<<<endl<<<<endl;

        return ;

    }

    dp1[]=a[];dp2[]=a[];

    dp3[]=a[];dp4[]=a[];

    int len1=,len2=,len3=,len4=;

    for(int i=;i<=n;i++)

    {

        if(a[i]<=dp1[len1])dp1[++len1]=a[i];//最长不上升子序列

        else

        {

            int j=upper_bound(dp1+,dp1+len1+,a[i],cmp1())-dp1;

            dp1[j]=a[i];

        }

        if(a[i]>dp2[len2])dp2[++len2]=a[i];//最长上升子序列

        else

        {

            int j=lower_bound(dp2+,dp2+len2+,a[i])-dp2;

            dp2[j]=a[i];

        }

        if(a[i]>=dp3[len3])dp3[++len3]=a[i];//最长不下降子序列

        else

        {

            int j=upper_bound(dp3+,dp3+len3+,a[i])-dp3;

            dp3[j]=a[i];

        }

        if(a[i]<dp4[len4])dp4[++len4]=a[i];//最长下降子序列

        else

        {

            int j=lower_bound(dp4+,dp4+len4+,a[i],cmp1())-dp4;

            dp4[j]=a[i];

        }

    }

    cout<<len1<<endl<<len2<<endl<<len3<<endl<<len4<<endl;

    return ;

}