#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef unsigned long long ULL;


int n;
int f[30];
string s;
int len;
struct Node
{
    ULL x;
    int id;
}a[1000005];
int ans[1000005];
bool cmp(Node a,Node b)
{
    if (a.x!=b.x) return a.x<b.x;
    return a.id<b.id;
}
const ULL base=233;
int main()

{

    scanf("%d",&n);
    for (int z=1;z<=n;++z)
    {
        cin>>s;
        memset(f,0,sizeof(f));
        len=s.size();
        for (int i=0;i<len;++i) f[s[i]-'A']++;
        s="";
        for (int i=0;i<26;++i)
            for (int j=1;j<=f[i];++j) s+='A'+i;
        ULL now=0;
        for (int i=0;i<len;++i) now=now*base+s[i]-'A'+1;
        a[z].x=now;
        a[z].id=z;
    }
    sort(a+1,a+n+1,cmp);
    int dq=1;
    while (dq<=n)
    {
        int j=dq;
        while (j<=n&&a[j].x==a[dq].x) j++;
        for (int i=dq;i<j;++i) ans[a[i].id]=i-dq;
        dq=j;
    }
    for (int i=1;i<=n;++i) printf("%d\n",ans[i]);
    return 0;

}