#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
	int ch = 0, f = 0; x = 0;
	for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
	for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
	if(f) x = -x;
}
const int N = 2000005;
char s[100];
int a[N], dp[N], tim[N], n;
vector<int> vec[N];
int main(){
	read(n);
	int c = 0, sum = 0;
	for(int i = 1; i <= n; i++){
		scanf("%s", s);
		a[i] = strlen(s);
		c = max(a[i], c);
		sum += a[i] + 1;
	}
	int ans_d = 0, res = 0;
	for(int d = c; d <= sum; d++){
		int cur_text = a[1], cur_line = 1; vec[1].clear();
		for(int i = 2; i <= n; i++){
			vec[i].clear();
			if(cur_text + 1 + a[i] > d){
				//for(int j = cur_text + 1; j <= d; j++)
				//	vec[cur_line].push_back(j);
				cur_line++;
				cur_text = a[i];
			}
			else{
				vec[cur_line].push_back(++cur_text);
				cur_text += a[i];
			}
		}
		//if(d == 9) cout << d << " " << cur_line << endl;
		int m = cur_line;
		//for(int i = cur_text + 1; i <= d; i++)
		//	vec[m].push_back(i);
		for(int i = 1; i <= m; i++){
			for(auto x : vec[i]){
				//if(d == 9) cout << x << " ";
				tim[i*d+x] = d, dp[i*d+x] = 1;
				if(i > 1 && x > 1 && tim[(i-1)*d+(x-1)] == d)
					dp[i*d+x] = max(dp[i*d+x], dp[(i-1)*d+(x-1)] + 1);
				if(i > 1 && tim[(i-1)*d+x] == d)
					dp[i*d+x] = max(dp[i*d+x], dp[(i-1)*d+x] + 1);
				if(i > 1 && x < d && tim[(i-1)*d+(x+1)] == d)
					dp[i*d+x] = max(dp[i*d+x], dp[(i-1)*d+(x+1)] + 1);
				if(dp[i*d+x] > res){
					res = dp[i*d+x];
					ans_d = d;
				}
			}
		}
	}
	printf("%d %d\n", ans_d, res);
	
	return 0;
}