#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <cstring>
#include <functional>
#include <climits>
#include <list>
#include <ctime>
#include <complex>

#define F1(x,y,z) for(int x=y;x<z;x++)
#define F2(x,y,z) for(int x=y;x<=z;x++)
#define F3(x,y,z) for(int x=y;x>z;x--)
#define F4(x,y,z) for(int x=y;x>=z;x--)
#define pb push_back
#define LL long long
#define co complex<double>

#define MAX 100005
#define AMAX 1500
#define MOD 1000000007

#define f(c,d) ((1<<(c))*(d))

using namespace std;

int n,i;
vector<char> vt;
map<vector<char>,int> m;
map<vector<char>,int>::iterator it;
char x[50];

int main(){
    scanf("%d",&n);
    while(n--){
        vt.clear();
        i=0;
        scanf("%s",x);
        while(x[i])vt.pb(x[i++]);
        sort(vt.begin(),vt.end());
        it=m.insert(make_pair(vt,0)).first;
        printf("%d\n",it->second++);
    }
    //system("pause");
    return 0;
}