#include <bits/stdc++.h>
using namespace std;
//#include<atcoder/all>
//using namespace atcoder;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
constexpr ll MAX = 2000000000000000000;
constexpr ld PI = 3.14159265358979;
constexpr ll MOD = 0;//2024948111;
ld dotorad(ld K){ return PI * K / 180.0; }
ld radtodo(ld K){ return K * 180.0 / PI; }
mt19937 mt;
void randinit(){ srand((unsigned)time(NULL));mt = mt19937(rand()); }
int main(){
    ll N;
    cin >> N;
    vector<string> S(N);
    for(ll i = 0; i < N; i++) cin >> S[i];
    for(ll i = 0;i < N;i++){
        ll a = -1,b = -1;
        char c = 127;
        for(ll j = 0;j < (ll)S[i].size();j++){
            c = min(c,S[i][j]);
        }
        for(ll j = (ll)S[i].size() - 1;j >= 0;j--){
            if(S[i][j] == c){
                a = j;
                break;
            }
        }
        for(ll j = 0;j < (ll)S[i].size();j++){
            if(S[i][j] != c){
                b = j;
                break;
            }
        }
        //cerr << a << " " << b << endl;
        if(a != -1 && b != -1){
            swap(S[i][a],S[i][b]);
        }
        //cerr << S[i] << endl;
    }
    vector<string> T = S;
    sort(T.begin(),T.end());
    ll cnt = 0;
    for(ll i = 0;i < N;i++){
        if(S[i] == T[0]) cnt++;
    }
    for(ll i = 0;i < N;i++){
        if(S[i] == T[0]) cout << N + 1 - cnt << endl;
        else cout << 0 << endl;
    }
}