#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[100005], b[100005], g[100005];
int main() {
    int n = 0;
	while(~scanf("%d",&a[++n])); 
	--n;
	int d[100005] = {};
	d[1] = 1;
	int maxlen = -1;
	for (int i = 2; i <= n; i++)
	{
	    d[i] = 1;
	    for (int j = i - 1; j > 0; j--)
	    {
	        if (a[j] >= a[i])
	        {
	            d[i] = max(d[i], d[j]+1);
	        }
	    }
	    maxlen = max(maxlen, d[i]);
	}
	cout << maxlen << endl;
	
	int cnt = 0;
    for (int i = 1; i <= n; i++) {
        int k = 1;
        while (k <= cnt && g[k] < a[i]) k++;
        if (k > cnt) g[++cnt] = a[i];
        else g[k] = a[i];
    }
	cout << cnt << endl;
    return 0;
}