#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
using namespace std;
int ming[200005];
map<string,int>Q;
bool cmp(char a,char b){
    return a<b;
}
int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        memset(ming,0,sizeof(ming));
        for(int i=0;i<n;i++){
            char a[50];
            scanf("%s",&a);
            sort(a,a+strlen(a),cmp);
            printf("%d\n",Q[a]);
            Q[a]++;
        }
    }
    return 0;
}