#include <iostream>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#define inf 999999999
#define mo 1000000007
#define LL long long 
using namespace std;
char s[10000];
int n,l;
string st;
map <string,int> ma;
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%s",s);
        l=strlen(s);
        sort(s,s+l);
        st="";
        for (int j=0;j<l;j++) st+=s[j];
        if (ma.find(st)!=ma.end()) ma[st]++;
        else ma[st]=0;
        cout<<ma[st]<<endl; 
    }
}