# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
template<class T> bool is_sqare(T a) { if(floor(sqrt(a)) * floor(sqrt(a)) == a){ return true; }return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define exists(c, e)         ((c).find(e) != (c).end())
#ifdef LOCAL
#  include "_debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

void solve(){
	int n;
	cin >> n;
	vector<string> s(n);
	for(auto &x : s)cin >> x;
	vector<string> t = s;
	rep(i, n){
		debug(i);
		vector<int> r(26, len(s[i]));
		for(int j = len(s[i])-1;j >= 0;j--){
			if(r[s[i][j]-'a'] == len(s[i])){
				r[s[i][j]-'a'] = j;
			}
		}
		debug(r);
		bool flg = false;
		rep(j, len(s[i])){
			if(flg)break;
			rep(k, s[i][j]-'a'){
				if(r[k] == len(s[i]))continue;

				if(j < r[k]){
					swap(t[i][j], t[i][r[k]]);
					flg = true;
					break;
				}
			}
		}
		if(not flg){
			rep(j, len(s[i])-1){
				if(s[i][j] == s[i][j+1]){
					flg = true;
					break;
				}
			}
		}
		if(not flg){
			swap(t[i][len(t[i])-2], t[i][len(t[i])-1]);
		}
	}
	debug(t);
	string str = *min_element(all(t));
	map<string, int> cnt;
	rep(i, n)cnt[t[i]]++;
	rep(i, n){
		cout << (t[i] == str ? n+1-cnt[t[i]] : 0) << endl;
	}
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--)solve();
}