#include<iostream>
#include<cstdio>
using namespace std;
const int N = 1005;
int n, a[N];
int dp[N], f[N];
int main(void)
{
    while(cin >> a[++n]);
    n--;
    // 第一问，显然就是求最长不上升子序列
    for(int i = 1; i <= n; i++)
    {
        dp[i] = 1;
        for(int j = 1; j < i; j++)
        {
            if(a[i] <= a[j]) dp[i] = max(dp[i], dp[j] + 1);
        }
    }
    int ans = 1;
    for(int i = 1;i <= n; i++) ans = max(ans, dp[i]);
    cout << ans << endl;


    //第二问，考虑贪心
    int m = 0;
    for(int i = 1; i <= n; i++)
    {
        int left = 1, right = m;
        if(m == 0) 
        {f[++m] = a[i];continue;}
        int res = 0;
        while(left <= right)
        {
            int mid = (left + right) / 2;
            if(f[mid] >= a[i])
            {
                res = mid;
                right = mid - 1;
            }
            else left = mid + 1;
        }
        if(res) f[res] = a[i];
        else f[++m] = a[i];
    }
    cout << m << endl;
    return 0;
}