#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#define ll   long long
#define pb   push_back
#define mp   make_pair
#define orz  1000000007
//作者:中国江苏南京丁天行
//from CrAzYUnIoN
//I prefer being hacked than being FST
using namespace std;
int n,a[50],l;
string s;
map<pair<ll,ll>,int> m;
pair<ll,ll> cty(){
            ll t1=131,ans1=0,t2=181,ans2=0;
            for(int i=1;i<=l;i++)ans1=ans1*t1+a[i],ans2=ans2*t2+a[i];
            return mp(ans1,ans2);
}
int main()
{
    ios::sync_with_stdio(0);
    cin>>n;
    for(int i=1;i<=n;i++){
            cin>>s;
            l=s.size();
            for(int i=1;i<=l;i++)a[i]=s[i-1];
            sort(a+1,a+l+1);
            pair<ll,ll> o=cty();
            cout<<m[o]<<endl;
            m[o]++;
    }
    //system("pause");
    return 0;
}