#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <cctype>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <sstream>
#include <fstream>
#include <math.h>
#include <stack>
#include <queue>
#include <cstring>
#include <iostream>
using namespace std;

const int MAX = 522133279;
const double pi = 3.1415926535897;
const int mod = 1000000007;

int N;

int main( )
{
    string s;
    map<string, int> mp;
    cin >> N;

    for ( int i = 0; i < N; i++ )
    {
        cin >> s;
        sort(s.begin(), s.end() );

        if ( mp.find( s ) == mp.end( ) )
        {
            cout << 0 << endl;
            mp[s] = 1;
        }
        else
        {
            cout << mp[s]++ << endl;
        }
    }

    return 0;
}