#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

#define INF 0xfffff
using namespace std;

int cmp(const int &a, const int &b) {
	return a > b;
}

int a[INF], n = 1, sy[INF], sum[INF], num = 1, f;
int main(void) {
	while (getchar() != '\n') 
		cin >> a[n++];
	
	sy[1] = a[1];
	for (int i = 2; i <= n; ++i) {
		for (int j = 1; j <= num; ++j) {
			if (sy[j] > a[i]){ sy[j] = a[i]; f = true; sum[j]++;} 
			else continue;
		}
		if (f == true) continue;
		else {
			num++;
			sy[num] = a[i];
		}
	}
	
	sort(sum + 1, sum + num + 1, cmp);
	cout << sum[1] << endl;
	cout << num << endl;
	
	return 0;
}

Thank you!