#include<cstdio>
#include<cmath>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<list>
#define pi 4*atan(1)
#define eps 1e-10
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FF(i,n) for(int i = 0 ; i < n ; i++)
#define F(i,n) for(int i = 1 ; i <= n ; i++)
#define maxn 100000+10
#define mod 200907
#define met(a) memset(a,0,sizeof(a))
typedef long long LL;
//typedef __int64 LL;
using namespace std;
/*void read(int &x){
    #define CH getchar()
    char ch; x=0;for(ch=CH;ch<'0'||ch>'9';ch=CH);
    for(;ch>='0'&&ch<='9';x=x*10+ch-48,ch=CH);
}*/

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    int cnt[27];
    met(cnt);
    map<string,int> mp;
    while(n--)
    {
        string s;
        cin>>s;
        int len=s.length();
        for(int i=0;i<len;i++)
        {
            cnt[s[i]-'A']++;
        }
        string ss;
        for(int i=0;i<26;i++)
        {
            while(cnt[i])
            {
                ss+=i+'A';
                cnt[i]--;
            }
        }
        if(mp.find(ss)!=mp.end())
        {
            cout<<mp[ss]<<endl;
        }
        else cout<<"0"<<endl;
        mp[ss]++;
    }
    return 0;
}