#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

int vis[1000005], dp[1000005];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    vector<string> vec(n);
    for (auto &s : vec)
        cin >> s;

    pii ans = pii(-1, 0);

    auto check = [&](int width) {

        vector<int> arr;
        int cur = 0, cnt = 0;
        for (int i = 0; i < n; ++i) {
            if (cur == 0 || cur + 1 + SZ(vec[i]) > width) {
                if (cur != 0) ++cnt;
                cur = SZ(vec[i]);
            }
            else {
                vis[cnt * width + cur] = width;
                arr.pb(cnt * width + cur);
                dp[cnt * width + cur] = 1;
                cur += 1 + SZ(vec[i]);
            }
        }
        ++cnt;

        auto get_val = [&](int x, int y, int &mx) {
            if (x < 0 || y < 0 || x >= cnt || y >= width || vis[x * width + y] != width) return;
            mx = max(dp[x * width + y], mx);
        };

        int nw = 0;
        for (int i : arr) {
            int x = i / width, y = i % width;
            int mx = 0;
            get_val(x - 1, y - 1, mx);
            get_val(x - 1, y, mx);
            get_val(x - 1, y + 1, mx);
            dp[i] = max(1, mx + 1);
            nw = max(nw, dp[i]);
        }
        
        if (nw > ans.X)
            ans = pii(nw, width);
    };

    int sum = SZ(vec[0]), mx = SZ(vec[0]);
    for (int i = 1; i < n; ++i)
        sum += 1 + SZ(vec[i]), mx = max(mx, SZ(vec[i]));
    for (int i = mx; i <= sum; ++i)
        check(i);

    cout << ans.Y << " " << ans.X << "\n";
}