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

int n, S, d[3030];

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<array<int, 2>> tmp;

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

            for(int a=0, b=0;a<dp.size();a++) {
                while(b < tmp.size() && tmp[b][0] <= dp[a][0]) b++;

                if(2 <= b && tmp[b-2][0]+1 >= dp[a][0]) dp[a][1] = max(dp[a][1], tmp[b-2][1]+1);
                if(1 <= b && tmp[b-1][0]+1 >= dp[a][0]) dp[a][1] = max(dp[a][1], tmp[b-1][1]+1);
                if(b < tmp.size() && tmp[b][0]-1 == dp[a][0]) dp[a][1] = max(dp[a][1], tmp[b][1]+1);

                if(dp[a][1] > ans2) ans2 = dp[a][1], ans1 = L;
            }

            swap(dp, tmp), i = j;
        }
    }

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