#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#define MAXN 50
using namespace std;
char s[MAXN];
map<unsigned long long,int> mp;
unsigned long long b[MAXN];
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    b[0]=67;
    for (int i=1; i<26; i++)
        b[i]=b[i-1]*67;

    int n;
    while (scanf("%d\n",&n)!=EOF)
    {
        mp.clear();
        while (n--)
        {
            gets(s);
            unsigned tmp=0;
            for (int i=0; i<strlen(s); i++)
                tmp+=b[s[i]-'A'];
            printf("%d\n",mp[tmp]);
            mp[tmp]++;
        }
    }
    return 0;
}