#define ull unsigned long long
#define put(x) printf("%d\n",x)
#define putl(x) printf("%lld\n",x)
#define rep(x,y,z) for(int x=y;x<=z;++x)
#define fep(x,y,z) for(int x=y;x>=z;--x)
#define go(x) for(RE int i=link[x],y=a[i].y;i;y=a[i=a[i].next].y)
using namespace std;
const int N=2e6+10;
int n,tax[N],rak[N],sa[N],tp[N],height[N],M;
int sack[N],top,cnt[N];
ll ans[N];
char c[N];
inline int read()
{
int x=0,ff=1;
char ch=getchar();
while(!isdigit(ch)) {if(ch==‘-‘) ff=-1;ch=getchar();}
while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return x*ff;
}
inline void Qsort()
{
rep(i,0,M) tax[i]=0;
rep(i,1,n) tax[rak[i]]++;
rep(i,1,M) tax[i]+=tax[i-1];
fep(i,n,1) sa[tax[rak[tp[i]]]--]=tp[i];
}
inline void Suffixsort()
{
M=75;
rep(i,1,n) rak[i]=c[i]-‘0‘+1,tp[i]=i;
Qsort();
for(int w=1,p=0;p<n;M=p,w<<=1)
{
p=0;
rep(i,1,w) tp[++p]=n-w+i;
rep(i,1,n) if(sa[i]>w) tp[++p]=sa[i]-w;
Qsort();
swap(tp,rak);
rak[sa[1]]=p=1;
rep(i,2,n) rak[sa[i]]=(tp[sa[i]]tp[sa[i-1]]&&tp[sa[i]+w]tp[sa[i-1]+w])?p:++p;
}
}
inline void get_height()
{
int j,k=0;
rep(i,1,n)
{
if(k) k--;
j=sa[rak[i]-1];
while(c[i+k]==c[j+k]) ++k;
height[rak[i]]=k;
}
}
inline void solve()
{
rep(i,1,n) ans[i]+=n-i+1;
ll p=0;
rep(i,2,n)
{
int ct=1;
while(top&&height[i]<=height[sack[top]])
{
p-=(ll)height[sack[top]]cnt[top];
ct+=cnt[top];
top--;
}
sack[++top]=i;cnt[top]=ct;
p+=(ll)height[sack[top]]cnt[top];
ans[sa[i]]+=p;
}
top=0;p=0;
fep(i,n-1,1)
{
int ct=1;
while(top&&height[i+1]<=height[sack[top]])
{
p-=(ll)height[sack[top]]cnt[top];
ct+=cnt[top];
top--;
}
sack[++top]=i+1;cnt[top]=ct;
p+=(ll)height[sack[top]]cnt[top];
ans[sa[i]]+=p;
}
rep(i,1,n) putl(ans[i]);
}
int main()
{
//freopen("1.in","r",stdin);
get(n);
scanf("%s",c+1);
Suffixsort();
get_height();
solve();
return (0_0);
}
//以吾之血,铸吾最后的亡魂.
