#include <bits/stdc++.h>
using namespace std;

int dp[1000005], a[1000005], maxx = -1;

int main() {
	int n = 1;
	while (cin >> a[n]) ++n;
	n--;
	for (int i = 1; i <= n; ++i) {
		dp[i] = 1;
		for (int j = 1; j < i; ++j)
			if (dp[i] < dp[j] + 1 && a[i] <= a[j]) dp[i] = dp[j] + 1;
		maxx = max(dp[i], maxx);
	}
	cout << maxx << "\n";
	memset(dp, 1, sizeof(dp));
	maxx = -1;
	for (int i = 1; i <= n; ++i) {
		dp[i] = 1;
		for (int j = 1; j < i; ++j) {
			if (dp[i] < dp[j] + 1 && a[i] > a[j]) {
				dp[i] = dp[j] + 1;
			}
		}
		maxx = max(dp[i], maxx);
	}
	cout << maxx;
	return 0;
}