#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, a[110], cs[1010], ans, sum;
map<int, int> mp;
int dfs(int x, int l, int r) {
//	cout << x << ' ' << l << ' ' << r << endl;
	if(x == n + 1) {
		int w = 1, maxn = 1;
//		cout << cs[l + 1] << ' ';
		for(int i = l + 2; i < r; i ++) {
//			cout << cs[i] << ' ';
			if(cs[i] > cs[i - 1]) {
				w ++;
				maxn = max(maxn, w);
			}
			else {
				w = 1;
			}
		}
//		cout << endl;
		if(maxn == ans) {
			sum ++;
		}
		if(maxn > ans) {
			ans = maxn;
			sum = 1;
		}
		return 0;
	}
	cs[l] = a[x];
	dfs(x + 1, l - 1, r);
	cs[l] = 0;
	cs[r] = a[x];
	dfs(x + 1, l, r + 1);
	cs[r] = 0;
}
signed main() {
	freopen("lisshulie.in", "r", stdin);
	freopen("lisshulie.out", "w", stdout);
	cin >> n;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
	} 
//	cs[100] = a[1];
	dfs(1, 100, 101);
	cout << ans << ' ' << sum;
	return 0;
}