#include <bits/stdc++.h>
using namespace std;
#define int long long
const int B = 360;
mt19937 rnd(114514);
int ksm(int a, int b, int mod, int res = 1) {
	for (; b; a = a * a % mod, b >>= 1)
		if (b & 1) res = res * a % mod;
	return res;
}
const int mod[2] = {998244353, (int)1e9 + 9}, base = 19491001;
int seed[26];
string s;
int n, pre[200010][2], pw[200010][2], invpw[200010][2];
const int MAXN = 400010;
struct SAM {
	struct node {
		int nxt[26], fa, len;
	} t[MAXN];
	int cnt, lst, sz[MAXN], ind[MAXN];
	int dfn[MAXN], dep[MAXN], tot;
	int lg[MAXN], tr[20][MAXN];
	SAM() : cnt(1), lst(1), tot(0) {}
	void insert(int x) {
		int cur = ++cnt, p = lst;
		t[cur].len = t[lst].len + 1;
		for (; p && t[p].nxt[x] == 0; p = t[p].fa)
			t[p].nxt[x] = cur;
		int q = t[p].nxt[x];
		if (q == 0) t[cur].fa = 1;
		else if (t[q].len == t[p].len + 1) t[cur].fa = q;
		else {
			int r = ++cnt;
			t[r] = t[q], t[r].len = t[p].len + 1;
			for (; p && t[p].nxt[x] == q; p = t[p].fa)
				t[p].nxt[x] = r;
			t[q].fa = t[cur].fa = r;
		}
		sz[cur] = 1, lst = cur;
	}
	vector<int> e[MAXN];
	void dfs(int now, int ndep) {
		tr[0][dfn[now] = ++tot] = now, dep[now] = ndep;
		for (int v : e[now])
			dfs(v, ndep + 1), sz[now] += sz[v];
	}
	void build(string s) {
		lg[1] = 0;
		for (int i = 2; i < MAXN; i++)
			lg[i] = lg[i / 2] + 1;
		for (int i = 0; i < s.size(); i++)
			insert(s[i] - 'a'), ind[i] = lst;
		for (int i = 2; i <= cnt; i++)
			e[t[i].fa].push_back(i);
		dfs(1, 0);
		for (int i = 1; i <= lg[MAXN - 1]; i++) {
			int x = 1 << i;
			for (int j = 1; j + x - 1 <= tot; j++) {
				if (dep[tr[i - 1][j]] < dep[tr[i - 1][j + x / 2]])
					tr[i][j] = tr[i - 1][j];
				else tr[i][j] = tr[i - 1][j + x / 2];
			}
		}
	}
	int LCA(int x, int y) {
		if (x == y) return x;
		x = dfn[x], y = dfn[y];
		if (x > y) swap(x, y);
		int len = lg[y - (x++)];
		if (dep[tr[len][x]] < dep[tr[len][y - (1 << len) + 1]])
			return t[tr[len][x]].fa;
		return t[tr[len][y - (1 << len) + 1]].fa;
	}
	int LCS(int x, int y) {
		return t[LCA(ind[x], ind[y])].len;
	}
	void clear() {
		do {
			memset(t[cnt].nxt, 0, sizeof(t[cnt].nxt));
			t[cnt].fa = t[cnt].len = 0;
		} while (--cnt);
		cnt = lst = 1, tot = 0;
	}
} T;
pair<int, int> geth(int l, int r) {
	return {(pre[r][0] - pre[l - 1][0] + mod[0]) * invpw[l - 1][0] % mod[0],
			(pre[r][1] - pre[l - 1][1] + mod[1]) * invpw[l - 1][1] % mod[1]};
}
unordered_map<int, int> mp;
void solve1(int k) {
	int ans = 0;
	vector<pair<int, int>> v(n / k + 1);
	for (int i = 1; i + k - 1 <= n; i += k)
		v[i / k] = geth(i, i + k - 1);
	for (int j = 0; j <= k; j++) {
		for (int i = 1; i + k - 1 <= n; i += k) {
			auto tmp = v[i / k];
			if (j) {
				(tmp.first += mod[0] - pw[j][0] * seed[s[i + j - 1] - 'a'] % mod[0]) %= mod[0];
				(tmp.second += mod[1] - pw[j][1] * seed[s[i + j - 1] - 'a'] % mod[1]) %= mod[1];
			}
			if (j == 0) ans -= mp[tmp.first * mod[1] + tmp.second] * (k - 1);
			else ans += mp[tmp.first * mod[1] + tmp.second];
			mp[tmp.first * mod[1] + tmp.second]++;
		}
		mp.clear();
	}
	cout << ans << " ";
}
int lcp(int x, int y) {
	return T.LCS(n - x, n - y);
}
bool check(pair<int, int> p, pair<int, int> q) {
	int tmp = lcp(p.first, q.first);
	if (tmp >= p.second - p.first) return 1;
	p.first += tmp + 1, q.first += tmp + 1;
	return geth(p.first, p.second) == geth(q.first, q.second);
}
void solve2(int k) {
	vector<pair<int, int>> v;
	for (int i = 1; i + k - 1 <= n; i += k)
		v.push_back({i, i + k - 1});
	int ans = 0;
	for (int i = 0; i < v.size(); i++)
		for (int j = i + 1; j < v.size(); j++)
			ans += check(v[i], v[j]);
	cout << ans << " ";
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> s;
	reverse(s.begin(), s.end());
	T.build(s);
	reverse(s.begin(), s.end());
	s = " " + s;
	for (int i = 0; i < 26; i++)
		seed[i] = rnd() % mod[0];
	pw[0][0] = pw[0][1] = 1;
	for (int i = 1; i <= n; i++) {
		pw[i][0] = pw[i - 1][0] * base % mod[0];
		pw[i][1] = pw[i - 1][1] * base % mod[1];
		pre[i][0] = (pre[i - 1][0] + pw[i][0] * seed[s[i] - 'a']) % mod[0];
		pre[i][1] = (pre[i - 1][1] + pw[i][1] * seed[s[i] - 'a']) % mod[1];
	}
	invpw[n][0] = ksm(pw[n][0], mod[0] - 2, mod[0]);
	invpw[n][1] = ksm(pw[n][1], mod[1] - 2, mod[1]);
	for (int i = n; i >= 1; i--) {
		invpw[i - 1][0] = invpw[i][0] * base % mod[0];
		invpw[i - 1][1] = invpw[i][1] * base % mod[1];
	}
	for (int i = 1; i <= n; i++) {
		if (i <= B) solve1(i);
		else solve2(i);
	}
	cout << endl;
	return 0;
}