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

int main() {
	int n;
	cin>>n;
	vector<int> ln;

	int cm = 0;
	for(int i=0;i<n;i++) {
		string s;
		cin>>s;
		cm = max(cm, (int)s.size());
		ln.push_back(s.size());
	}
	int ans = 0, ccl = cm;
	for(int ml = cm; ml<= n * 85; ml++) {
		vector<int> cx(ml, 0), nx(ml, 0);
		int cv = -1, cln = 0;
		for(auto ct: ln) {
			if(cv + 1 + ct > ml) {
				cln += 1;
				cv = -1;
				cx = nx;
				nx = vector<int>(ml, 0);
			}
			if(cv > 0) {
				nx[cv] = max(max(cx[cv-1], cx[cv]), cx[cv+1]) + 1;
				//cout<<cv<<' '<<nx[cv]<<endl;
				if(nx[cv] > ans) {
					ans = nx[cv];
					ccl = ml;
				}
			}
			cv = cv + 1 + ct;
		}
		if( cln < ans) break;
	}
	cout<<ccl<<' '<<ans<<endl;
}