#include <bits/stdc++.h>

#define ll long long
using namespace std;
const int N = 1e6 + 5, mod = 1e9 + 7, A = 26;
int last[N], mx[N], id = 0, n;
vector<string> s;

int mxval(int i) {
    int ans = 0;
    if (last[i] == id - 1)
        ans = max(ans, mx[i]);
    if (i && last[i - 1] == id - 1)
        ans = max(ans, mx[i - 1]);
    if (last[i + 1] == id - 1)
        ans = max(ans, mx[i + 1]);
    return ans + 1;
}

int getmax(int len) {

    int rem = len, ans = 0, i = 0;
    id+=2;
    for (auto it: s) {
        if (it.size() + (rem != len) > rem) {
            id++;
            rem = len;
            i = 0;
        }
        if (i) {
            mx[i] = mxval(i);
            last[i] = id;
            ans = max(ans, mx[i]);
        }
        rem -= it.size() + (rem != len);
        i += it.size() + (rem != len);
    }
    return ans;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    int mn = 1e9, total = n;
    s = vector<string>(n);
    for (auto &it: s) {
        cin >> it;
        total += it.size();
        mn = min(mn, (int) it.size());
    }
    int ans = -1, ansindex = -1;
    for (int i = mn; i <= total; i++) {
        int res = getmax(i);
        if (res > ans) {
            ans = res;
            ansindex = i;
        }
    }
    cout << ansindex << " " << ans << "\n";
    return 0;
}