#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 300'000 + 10;
int n;
string s;
int a[N];

int pos[N], tmp[N], sa[N];
int lcp[N];

void initSA() { 
	for (int i = 1; i <= n; ++i) pos[i] = s[i] - 'a' + 1, sa[i] = i;
	for (int gap = 1; ; gap *= 2) { 
		auto cmp = [&](int i, int j) { 
			if (pos[i] != pos[j]) return pos[i] < pos[j];
			i += gap; j += gap;
			return i <= n && j <= n ? pos[i] < pos[j] : i > j;
		};
		sort(sa + 1, sa + n + 1, cmp);
		for (int i = 2; i <= n; ++i) tmp[i] = tmp[i - 1] + cmp(sa[i - 1], sa[i]);
		for (int i = 1; i <= n; ++i) pos[sa[i]] = tmp[i] + 1;
		if (tmp[n] == n - 1) break;
	}
	for (int i = 1, k = 0; i <= n; ++i) { 
		if (pos[i] == n) continue;
		for (int j = sa[pos[i] + 1]; s[i + k] == s[j + k]; ) k += 1;
		lcp[i] = k;
		if (k) k -= 1;
	}
}

int cnt, value = -1'000'000'000'000'000'000;
vector<int> mi[N], ma[N];
int id[N];
int root(int u) { return id[u] < 0 ? u : id[u] = root(id[u]); }
void add(int u, int v) { 
	u = root(u); v = root(v);
	if (u == v) return;
	if (id[u] > id[v]) swap(u, v);

	cnt -= id[v] * (id[v] + 1) / 2;
	cnt -= id[u] * (id[u] + 1) / 2;

	id[u] += id[v];
	id[v] = u;

	cnt += id[u] * (id[u] + 1) / 2;

	mi[u].insert(mi[u].end(), mi[v].begin(), mi[v].end());
	sort(mi[u].begin(), mi[u].end());
	if (mi[u].size() > 2) mi[u].resize(2);
	if (mi[u].size() == 2) value = max(value, mi[u][0] * mi[u][1]);

	ma[u].insert(ma[u].end(), ma[v].begin(), ma[v].end());
	sort(ma[u].begin(), ma[u].end(), greater<>());
	if (ma[u].size() > 2) ma[u].resize(2);
	if (ma[u].size() == 2) value = max(value, ma[u][0] * ma[u][1]);
}

vector<int> save[N];

int32_t main() { 
	cin.tie(0)->sync_with_stdio(0);

	cin >> n;
	cin >> s;
	for (int i = 1; i <= n; ++i) cin >> a[i];

	s = '@' + s;
	initSA();

	for (int i = 1; i <= n; ++i) save[lcp[i]].push_back(i);
	for (int i = 1; i <= n; ++i) {
		mi[i].push_back(a[i]);
		ma[i].push_back(a[i]);
	}
	memset(id, -1, sizeof id);
	
	vector<pair<int, int>> answer;
	for (int i = n; i >= 1; --i) { 
		for (const auto& x : save[i - 1]) if (pos[x] != n) add(x, sa[pos[x] + 1]);
		answer.push_back({cnt, !cnt ? 0 : value});
	}

	reverse(answer.begin(), answer.end());
	for (const auto& [a, b] : answer) cout << a << " " << b << "\n";
}