#include "bits/stdc++.h"
#include <algorithm>
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using ll = long long;
using LL = long long;

using pil = pair<int, ll>;

template<typename T> 
bool chmin(T& x, T v) {
	if (v < x) {
		x = v;
		return true;
	}
	return false;
}

void solve(int TC) {
	int n;
	cin >> n;

	string s;
	cin >> s;
	s = " " + s;

	struct Interval {
		int l, r, cen;
	};

	vector<Interval> I;
	vector<vector<int>> Lb(n + 1), Rb(n + 1);

	for (int i = 1; i <= n; i++) {
		int cen = i;
		int L = cen, R = cen;
		I.push_back({L, R, cen});
		Lb[L].push_back(I.size() - 1);
		Rb[R].push_back(I.size() - 1);
		// I.push_back({L, R, cen});
		while (L > 1 && R < n && s[L - 1] != s[R + 1]) {
			--L, ++R;
			I.push_back({L, R, cen});
			Lb[L].push_back(I.size() - 1);
			Rb[R].push_back(I.size() - 1);
			// I.push_back({L, R, cen});
		}
	}

	for (int i = 1; i <= n; i++) {
		sort(Lb[i].begin(), Lb[i].end(), [&](int x, int y) {
			return I[x].r < I[y].r;
		});
		sort(Rb[i].begin(), Rb[i].end(), [&](int x, int y) {
			return I[x].l < I[y].l;
		});
	}

	vector<vector<pil>> dp(n + 1, vector<pil>(n + 1, {2 * n, 0}));
	dp[1][n] = {0, 0};

	pil ans = {2 * n, 0};

	for (int len = n; len >= 1; len--) {
		for (int i = 1; i <= n; i++) {
			int j = i + len - 1;
			if (j > n) break;

			if (len == 1) {
				chmin(ans, dp[i][j]);
			}
			else {
				if (dp[i][j] == pil(2 * n, 0)) continue;

				int pntL = upper_bound(Lb[i].begin(), Lb[i].end(), j, [&](int x, int y) {
					return x < I[y].r;
				}) - Lb[i].begin() - 1;
				if (pntL >= 0 && pntL < Lb[i].size()) {
					chmin(dp[I[Lb[i][pntL]].cen + 1][j], {dp[i][j].first + 1, dp[i][j].second + (j - I[Lb[i][pntL]].r)});
				}

				int pntR = lower_bound(Rb[j].begin(), Rb[j].end(), i, [&](int x, int y) {
					return I[x].l < y;
				}) - Rb[j].begin();
				if (pntR >= 0 && pntR < Rb[j].size()) {
					chmin(dp[i][I[Rb[j][pntR]].cen - 1], {dp[i][j].first + 1, dp[i][j].second + (I[Rb[j][pntR]].l - i)});
				}

			}
		}
	}


	// for (int i = 1; i <= n; i++) {
	// 	for (int j = i; j <= n; j++) {
	// 		cout << i << ", " << j << " : " << dp[i][j].first << " " << dp[i][j].second << endl;
	// 	}
	// }

	cout << ans.first + 1 << " " << ans.second << "\n";

}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);

	int t = 1;
	// cin >> t;

	for (int i = 1; i <= t; i++) {
		solve(i);
	}
}