#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<string> s(n);
  for (auto& s : s) {
    cin >> s;
    int n = s.size();
    int cnt[26]{};
    int last[26];
    memset(last, -1, sizeof(last));
    rep(i, n) cnt[s[i] - 'a']++, last[s[i] - 'a'] = i;
    [&]() {
      int ptr = 0;
      rep(i, n) {
        while (!cnt[ptr]) ptr++;
        if (s[i] - 'a' != ptr) {
          swap(s[i], s[last[ptr]]);
          return;
        }
        cnt[ptr]--;
      }
      rep(i, n - 1) if (s[i] == s[i+1]) return;
      swap(s[n-2], s[n-1]);
    }();
  }
  string& mn = *min_element(all(s));
  int res = n + 1 - count(all(s), mn);
  rep(i, n) cout << (s[i] == mn ? res : 0) << '\n';
}