#include <bits/stdc++.h>
using namespace std;
int a[100005] , dp[100005] , dp2[100005] , ans;
int n , x;
int main () {
    while (cin >> x) {
        a[++n] = x;
    }
    
	for (int i = 1; i <= n; i++) {
		dp[i] = 1;
		for (int j = 1; j < i; j++) {
			if(a[j] >= a[i]) {
				dp[i] = max(dp[i] , dp[j] + 1);
			}
		}
		ans = max(ans ,  dp[i]);
	}
    cout << ans << endl;
    
	int cnt;
	for (int i = 1; i <= n; i++) {
		dp2[i] = 1;
		for (int j = 1; j < i; j++) {
			if (a[j] < a[i]) {
				dp2[i] = max(dp2[i] , dp2[j] + 1);
			}
			cnt = max(cnt , dp2[i]);
		}
	}
    cout << cnt;
    
	return 0;
}