#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iostream>
#include<queue>
#include<cmath>

using namespace std;

#define For(i,l,r) for(int i=(l);i<=(r);i++)
#define Down(i,r,l) for(int i=(r);i>=(l);i--)
#define mset(a,x) memset(a,x,sizeof(a))
#define INF 0x7fffffff

struct node
{
    char s[45];
    int id;
}a[100005];

int cmp(node a,node b)
{
    int tmp=strcmp(a.s,b.s);
    return tmp==0?a.id<b.id:tmp<0;
}

int n,ans[100005];

int main()
{
    while(~scanf("%d",&n))
    {
        For(i,1,n)
        {
            scanf("%s",a[i].s);
            a[i].id=i;
            sort(a[i].s,a[i].s+strlen(a[i].s));
        }
        sort(a+1,a+1+n,cmp);
        a[0].s[0]='\0';
        int num=0;
        For(i,1,n)
        {
            if(strcmp(a[i].s,a[i-1].s)==0) num++;
            else num=0;
            ans[a[i].id]=num;
        }
        For(i,1,n) printf("%d\n",ans[i]);
    }
    return 0;
}