#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
using namespace std;

const int MAXN = 100;
const int MAXM = 3000;
char str[MAXN];
int n, len[MAXM], minn, sum, eid, maxx, cnt[MAXN * MAXM], ans, ansx;
map<int, int> G[MAXM];

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> str + 1;
		len[i] = strlen(str + 1);
		minn = max(minn, len[i]); 
		sum += len[i];
	}	
	for (int gap = minn; gap <= sum + MAXM; gap++) {
		int maxx = 0;
		int j = 1, Len = 0, eid1 = 0;
		while (j <= n) {
			++eid1;
			while (Len + len[j] <= gap && j <= n) {
				Len = Len + len[j] + 1;
				if (Len + len[j + 1] <= gap && j < n) {
					G[eid1][Len] = 1;
					int A = 0;
					if (G[eid1 - 1][Len - 1]) A = max(A, cnt[Len - 1]);
					if (G[eid1 - 1][Len]) A = max(A, cnt[Len]); 
					if (G[eid1 - 1][Len + 1]) A = max(A, cnt[Len + 1]);
					cnt[Len] = A + 1;
					maxx = max(maxx, cnt[Len]);
				}
				j++;
			}
			Len = 0;
		}
		for (int i = 1; i <= eid1; i++) {
			for (auto x:G[i]) {
				cnt[x.first] = 0;
			}
			G[i].clear();
		}
		if (maxx > ans) {
			ans = maxx;
			ansx = gap;
		}
	}
	cout << ansx << " " << ans << endl;
	return 0;
}