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

map<string ,int >mp;


int main()
{
    int t;
    cin>>t;
    string tmp;
    while(t--)
    {
        cin>>tmp;
        sort(tmp.begin(),tmp.end());
        if(mp.find(tmp)!=mp.end())
        {
            cout<<mp[tmp]<<endl;
            mp[tmp]++;
        }
        else
        {
            cout<<"0"<<endl;
            mp[tmp]=1;
        }


    }

    return 0;
}