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

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N; cin >> N;

    int max_len = 0;
    vector<string> S(N);
    for (int i = 0; i < N; ++i) {
        cin >> S[i];
        max_len = max(max_len, int(S[i].size()));
    }

    int longest_river = 0, line_id = -1, steps = 1e9;
    for (; steps > longest_river; max_len++) {
        steps = 0;
        vector<int> dp(max_len);
        for (int i = 0, j = 0; i < N; i = j+1) {
            steps++;
            int width = int(S[i].size());
            vector<int> ndp(max_len);
            j = i;
            while (j+1 < N && width + 1 + int(S[j+1].size()) <= max_len) {
                ndp[width] = dp[width] + 1;
                if (width < max_len-1) {
                    ndp[width] = max(ndp[width], dp[width +1] + 1);
                }
                if (width >= 1) {
                    ndp[width] = max(ndp[width], dp[width-1] + 1);
                }
                if (ndp[width] > longest_river) {
                    longest_river = ndp[width];
                    line_id = max_len;
                }
                width += 1 + int(S[j+1].size());
                j++;
            }
            dp.swap(ndp);
        }
    }

    cout << line_id << ' ' << longest_river << '\n';
}