#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>

#define LL long long

using namespace std;

const int maxn = 40 +10;
char s[maxn];
map<string,int>ans;
int main()
{
    int N;
    while(scanf("%d",&N)!=EOF)
    {
        ans.clear();
        while(N--)
        {
            scanf("%s",s);
            sort(s,s+strlen(s));
            if (ans.find(s) == ans.end())
            {
                printf("0\n");
                ans[s] = 1;
            }
            else
            {
                int cut = ans[s];
                printf("%d\n",cut);
                ans[s]++;
            }
        }
    }
    return 0;
}