#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <map>

using namespace std;

map<long long, int>m;

char name[50];

int p[50];

void init()
{
    int ct = 0;
    for (int i = 2 ; ct < 50 ; i++)
    {
        bool isp = true;
        for (int j = 2 ; j * j <= i ; j++)
            if (i % j == 0)
            {
                isp = false;
                break;
            }
        if (isp)
            p[ct++] = i;
    }
}

int main()
{
    init();
    int n;
    scanf("%d", &n);
    while (n--)
    {
        scanf("%s", name);
        long long hash = 1;
        for (int i = 0 ; name[i] ; i++)
            hash *= p[name[i] - 'A'];
        printf("%d\n", m[hash]++);
    }
    return 0;
}