#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <set>
#include <map>
#include <array>

using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()

const int N = 2500 + 3;

int n;
vector<int> lens;

int river(int w){
    // cout << "river " << w << endl;
    int i = 0;
    int ans = 0;
    vector<pair<int, int>> prev;

    while(i < n){
        int sum = 0;
        vector<pair<int, int>> curr;
        for(; i < n; ++i){
            sum += lens[i];
            if(sum > w){
                sum -= lens[i];
                break;
            }
            curr.push_back({sum, 1});
            sum += 1;
        }
        curr.pop_back();

        int ptr = 0;
        for(int j = 0; j < curr.size(); ++j){
            while(ptr < prev.size() && prev[ptr].first < curr[j].first - 1){
                ++ptr;
            }
            for(int j2 = ptr; j2 < min(ptr + 3, (int)prev.size()); ++j2){
                if(abs(curr[j].first - prev[j2].first) <= 1){
                    curr[j].second = max(curr[j].second, prev[j2].second + 1);
                }
            }
            ans = max(ans, curr[j].second);
        }
        swap(curr, prev);
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 0; i < n; ++i){
        string s;
        cin >> s;
        lens.push_back(s.size());
    }

    int l = *max_element(lens.begin(), lens.end());
    int r = accumulate(all(lens), 0) + n - 1;

    int ans = 0, ans_idx = -1;
    for(int i = l; i <= r; ++i){
        int cand = river(i);
        if(cand > ans){
            ans = cand;
            ans_idx = i;
        }
    }

    cout << ans_idx << " " << ans << "\n";
}