#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <string.h>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <math.h>
#include <vector>
#include <ctime>
#include <cctype>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <numeric>
#include <stdexcept>
#include <utility> 
using namespace std;
#define ll long long 
#define m0(a) memset(a, 0, sizeof(a))
#define m1(a) memset(a, -1, sizeof(a))
#define C1(x)  cout<<x<<endl
#define C2(x,y)  cout<<x<<" "<<y<<endl
#define C3(x,y,z)  cout<<x<<" "<<y<<" "<<z<<endl
#define C4(x,y,z,zz)  cout<<x<<" "<<y<<" "<<z<<" "<<zz<<endl
#define min(x,y) ((x)>(y)?(y):(x))
#define max(x,y) ((x)>(y)?(x):(y))
#define r() (rand()/(double)(RAND_MAX))
struct stu
{
    int x,y,z;
    bool operator < (const stu &b) const
    {
        return x<b.x;    
    }
};
const int inf = 0x3f3f3f3f; 
const double eps = 1e-15;
const double pi = acos((double)-1) ;
const int maxn = 100100;
const ll M = 1e9+7;
int i,j,k,l,m,n,x,y,z,ans,num;
int a[maxn]={0};
int v[maxn]={0};
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
ll gcd(ll x,ll y)
{
    if (x==0 || y==0)  return x+y;
    return (x%y==0)?y:gcd(y,x%y);
}
map<string,int> ma;
int main () 
{
    srand((unsigned)time(NULL));
    #ifdef ONLINE_JUDGE
    
    #else
    
        //freopen("in.in","r",stdin);
        //freopen("in.out","w",stdout);
    
    #endif
    int cas;
    scanf("%d",&cas);
    for (int casi=1;casi<=cas;casi++)
    {
        char cc[100];
        scanf("%s",&cc);
        sort(cc,cc+strlen(cc));
        string s=cc;
        //C1(s);
        int u=ma[s];
        ma[s]++;
        C1(u);
        //printf("%d\n",casi);
    }
    return 0;
}