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

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

int q[2][300300], sz[2];

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++) {
        for(int i=1, u=0;i<=n;i++, u=!u) {
            int C = d[i], j = i;
            while(j+1 <= n && C+1+d[j+1] <= L) q[u][sz[u]++] = ++C, C += d[++j];

            for(int i=0;i<sz[u];i++) {
                int C = q[u][i];
                dp[C] = max({tmp[C-1], tmp[C], tmp[C+1]})+1;
                if(dp[C] > ans2) ans2 = dp[C], ans1 = L;
            }
            for(int i=0;i<sz[!u];i++) {
                tmp[q[!u][i]] = 0;
            }
            sz[!u] = 0, i = j, swap(dp, tmp);
        }

        for(int i=0;i<2;i++) for(int j=0;j<sz[i];j++) tmp[q[i][j]] = 0;
    }

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