/* http://www.cnblogs.com/karl07/ */

 #include <cstdlib>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <algorithm>

 using namespace std;

 struct trie{

     trie *next[],*fail;

     int cnt,x;

 }t[];

 int n;

 char s[];

 trie *root,*NEW=t;

 trie *Q[],*wh[];

 trie *new1(int x){NEW++; NEW->cnt=; NEW->x=x; return NEW;}

 trie *insert(trie *p,int x){

     if (!p->next[x]) p->next[x]=new1(x);

     p->next[x]->cnt++;

     return p->next[x];

 }

 #define pnf p->next[i]->fail

 void build_fail(){

     int l=,r=;

     for (int i=;i<;i++) if (root->next[i]) { Q[++r]=root->next[i]; root->next[i]->fail=root;}

     while (l!=r){

         trie *p=Q[++l];

         for (int i=;i<;i++){

             if (p->next[i]){

                 Q[++r]=p->next[i];

                 for (pnf=p->fail ; pnf!=root && !pnf->next[i] ; pnf=pnf->fail);

                 if (pnf->next[i]) pnf=pnf->next[i];

             }

         }

     }

     for (int i=r;i>=;i--) Q[i]->fail->cnt+=Q[i]->cnt;

 }

 int main(){

     scanf("%d",&n);

     root=new1(-);

     for (int i=;i<=n;i++){

         scanf("%s",s);

         wh[i]=root;

         int l=strlen(s);

         for (int j=;j<l;j++) wh[i]=insert(wh[i],s[j]-'a');

     }

     build_fail();

     for (int i=;i<=n;i++) printf("%d\n",wh[i]->cnt);

     return ;

 }