#include <iostream>
#include <algorithm>

using namespace std;

int n,a[100010],dpu[100010],dpd[100010];

int main()
{
    int i = 1;
    while(cin >> a[i])
    {
        dpu[i] = 1;
        dpd[i] = 1;
        i++;
    }
    i--;
    n = i;
    for(i = 2;i <= n;i++)
    {
        for(int j = 1;j < i;j++)
        {
            if(a[j] < a[i])
                dpu[i] = max(dpu[j] + 1,dpu[i]);
            else
                dpd[i] = max(dpd[j] + 1,dpd[i]);
        }
    }
    int au = -1,ad = -1;
    for(int i = 1;i <= n;i++)
    {
        au = max(dpu[i],au);
        ad = max(dpd[i],ad);
    }
    printf("%d\n%d\n",ad,au);
    return 0;
}