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

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1 << 12;

string s[N];
int row[N], pos[N], firstInRow[N], dp[N];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	int minWidth = 0, sum = 0;
	FOR(i, 0, n) {
		cin >> s[i];
		minWidth = max(minWidth, SZ(s[i]));
		sum += SZ(s[i]);
	}
	int bestW = 0, ans = 0;
	FOR(w, minWidth, sum + n + 47) {
		FILL(dp, 0);
		int curPos = 0, curRow = 0;
		FOR(i, 0, n) {
			if (curPos + SZ(s[i]) <= w) {
				curPos += SZ(s[i]) + 1;
			}
			else {
				curRow++;
				curPos = SZ(s[i]) + 1;
				firstInRow[curRow] = i;
			}
			pos[i] = curPos - 1;
			row[i] = curRow;
		}
		firstInRow[curRow + 1] = n;
		int ptr = 0;
		FOR(i, 0, n - 1) {
			if (row[i] != row[i + 1]) {
				continue;
			}
			dp[i] = max(dp[i], 1);
			if (dp[i] > ans) {
				bestW = w;
				ans = dp[i];
			}
			if (i == 0 || row[i] != row[i - 1]) {
				ptr = firstInRow[row[i] + 1];
			}
			while (ptr < n && row[ptr] == row[i] + 1 && pos[ptr] < pos[i] - 1) {
				ptr++;
			}
			FOR(j, ptr, ptr + 2) {
				if (j < n && row[j] == row[i] + 1 && pos[j] <= pos[i] + 1) {
					dp[j] = max(dp[j], dp[i] + 1);
				}
			}
		}
	}
	cout << bestW << " " << ans << "\n";
}