#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 2e5+5;
int n,tot=1,last=1,tr[N][26],fa[N],len[N],P[N],nxt[N],head[N];
char s[N];long long ans[N];
void extend(int c,int id){
    int v=last,u=++tot;last=tot;
    len[u]=len[v]+1;P[u]=id;
    while (v&&!tr[v][c]) tr[v][c]=u,v=fa[v];
    if (!v) fa[u]=1;
    else{
        int x=tr[v][c];
        if (len[x]==len[v]+1) fa[u]=x;
        else{
            int y=++tot;
            memcpy(tr[y],tr[x],sizeof(tr[y]));
            fa[y]=fa[x];fa[x]=fa[u]=y;len[y]=len[v]+1;
            while (v&&tr[v][c]==x) tr[v][c]=y,v=fa[v];
        }
    }
}
void dfs(int u){
    for (int i=head[u];i;i=nxt[i]) dfs(i);
    for (int i=head[u];i;i=nxt[i]){
        if (P[i]==-1) {P[u]=-1;break;}
        if (!P[i]) continue;
        if (!P[u]) P[u]=P[i];else if (P[u]!=P[i]) {P[u]=-1;break;}
    }
}
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;++i){
        scanf("%s",s+1);int l=strlen(s+1);last=1;
        for (int j=1;j<=l;++j) extend(s[j]-'a',i);
    }
    for (int i=1;i<=tot;++i) nxt[i]=head[fa[i]],head[fa[i]]=i;
    dfs(1);
    for (int i=1;i<=tot;++i) if (P[i]>0) ans[P[i]]+=len[i]-len[fa[i]];
    for (int i=1;i<=n;++i) printf("%lld\n",ans[i]);
    return 0;
}