#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;
const int maxn = 3e5 + 20, N = 26;
struct SAM {int mxCnt[maxn << 1], son[maxn << 1][N], fa[maxn << 1], pos[maxn << 1];int flag[maxn << 1][3]; //是否前缀节点int mi[maxn << 1], mx[maxn << 1];int root, last, DFN, t;int create() {++t;mxCnt[t] = pos[t] = fa[t] = NULL;
//        mi[t] = inf, mx[t] = -inf;for (int i = 0; i < 3; ++i) flag[t][i] = NULL;for (int i = 0; i < N; ++i) son[t][i] = NULL;return t;}void init() {++DFN;t = 0, root = 1;last = create();}void addChar(int x, int _pos, int id) { // _pos表示在原串中的位置int p = last;int np = create();last = np;mxCnt[np] = mxCnt[p] + 1, pos[np] = _pos, flag[np][id] = DFN; //前缀节点for (; p && son[p][x] == NULL; p = fa[p]) son[p][x] = np;if (p == NULL) {fa[np] = root;return;}int q = son[p][x];if (mxCnt[q] == mxCnt[p] + 1) {fa[np] = q;return;}int nq = create(); //用来代替q的，默认不是前缀节点flag[nq][id] = DFN - 1; //默认不是前缀节点pos[nq] = pos[q]; //pos要和q相同for (int i = 0; i < N; ++i) son[nq][i] = son[q][i];fa[nq] = fa[q], mxCnt[nq] = mxCnt[p] + 1;fa[q] = nq, fa[np] = nq;for (; p && son[p][x] == q; p = fa[p]) son[p][x] = nq;}int dp[maxn << 1], in[maxn << 1], que[maxn << 1];void topo() { //多次使用不用清空for (int i = 2; i <= t; ++i) {in[fa[i]]++;mi[i] = mx[i] = pos[i];}int head = 0, tail = 0;for (int i = 2; i <= t; ++i) {if (in[i] == 0) que[tail++] = i;}while (head < tail) {int cur = que[head++];if (cur == root) break;mx[fa[cur]] = max(mx[fa[cur]], mx[cur]);in[fa[cur]]--;if (in[fa[cur]] == 0) que[tail++] = fa[cur];}}
} sam;
LL cnt[maxn], sub[maxn];
void add(int be, int en, LL val, LL d) {cnt[be] += val;cnt[en + 1] -= d * (en - be) + val;sub[be + 1] += d;sub[en + 1] -= d;
}
void init(int en) {for (int i = 1; i <= en; ++i) {sub[i] += sub[i - 1];cnt[i] += cnt[i - 1] + sub[i];}
}char str[maxn];void work() {int len;cin >> len;sam.init();scanf("%s", str + 1);LL ans = 0;for (int i = 1; str[i]; ++i) {sam.addChar(str[i] - 'a', i, 0);}sam.topo();
//    int fuck = 5;
//    printf("%d\n", sam.mx[fuck + 1]);for (int i = 2; i <= sam.t; ++i) {ans += sam.mxCnt[i] - sam.mxCnt[sam.fa[i]];if (sam.mx[i] - sam.mxCnt[i] + 1 <= sam.mi[i]) {int be = sam.mx[i] - sam.mxCnt[i] + 1;int en = min(sam.mx[i] - sam.mxCnt[sam.fa[i]], sam.mi[i]);int len = en - be + 1;
//            printf("%d %d\n", be, en);add(be, en, 1, 1);be = en + 1;en = sam.mi[i];  //还有一段，要全部加上len个
//            printf("%d %d\n\n", be, en);if (be <= en) add(be, en, len, 0);}}init(len);
//    printf("%d\n", cnt[4]);for (int i = 1; i <= len; ++i) {printf("%lld ", ans + 1LL * (i) * (len - i + 1) - cnt[i]);}}int main() {
#ifdef localfreopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endifwork();return 0;
}