#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <map>
using namespace std;

const int N = 50;

int n;
char s[N];
vector<char> t;
map<vector<char>, int> hash;

int main() {

    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf(" %s", s + 1);
        int l = strlen(s + 1);
        sort(s + 1, s + l + 1);
        t.clear();
        for (int j = 1; j <= l; ++j)
            t.push_back(s[j]);
        int &ans = hash[t];
        printf("%d\n", ans++);
    }

    return 0;
}