#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <string>
#include <map>
#include <set>
using namespace std;
const int maxn = 1e5 + 10;
char str[50];
int cnt[maxn], k = 0;
map <string, int> mp;
set <string> Q;

int main(){
    int n;
    scanf("%d", &n);
    while(n--){
        scanf("%s", str);
        int len = strlen(str);
        sort(str, str+len);
        if(Q.find(str) == Q.end()){
            mp[str] = k++;
            Q.insert(str);
        }
        printf("%d\n", cnt[mp[str]]);
        cnt[mp[str]]++;
    }
}