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

int n, S, d[3030], dp[300300], tmp[300300];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1;i<=n;i++) {
        string s; cin >> s;
        d[i] = s.size(), S += d[i]+1;
    }

    int mx = *max_element(d+1, d+1+n);
    int ans1 = 0, ans2 = 0;

    for(int L=mx;L<S;L++) {
        vector<int> V;
        int cnt = 0;

        for(int i=1;i<=n;i++) {
            int C = d[i], j = i;
            vector<int> U;
            while(j+1 <= n && C+1+d[j+1] <= L) U.push_back(++C), C += d[++j];

            for(auto C : U) {
                dp[C] = max({tmp[C-1], tmp[C], tmp[C+1]})+1;
                if(dp[C] > ans2) ans2 = dp[C], ans1 = L;
            }
            for(auto C : V) tmp[C] = 0;
            swap(dp, tmp), swap(U, V);

            i = j, cnt++;
        }
        if(cnt <= ans2) break;

        for(auto C : V) tmp[C] = 0;
    }

    cout << ans1 << " " << ans2 << "\n";
}