#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<stack>
using namespace std;
typedef long long ll;
const int maxn = 8e2+5;
const int inf = 0x3f3f3f3f;
const int mod = 9973;
map<string,int>mp;
int main()
{
    int n;
    char s[44];
    while(scanf("%d",&n)==1){
        mp.clear();
        while(n--){
            scanf("%s",s);
            int len = strlen(s);
            sort(s,s+len);
            cout<<mp[s]<<endl;
            mp[s]++;
        }
    }
    return 0;
}