#include <bits/stdc++.h>
using namespace std;

static inline void solve() {
  int n;
  cin >> n;
  vector<pair<string, int>> S(n);
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    S[i] = {s, i};
  }
  sort(S.begin(), S.end());
  vector<int> ans(n, 0);
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (S[i].first.size() == S[j].first.size()) {
        string& a = S[i].first, b = S[j].first;
        int m = a.size();
        int diffs = 0;
        for (int k = 0; diffs < 2 && k < m; k++) {
          diffs += a[k] != b[k];
        }
        int add = diffs == 1 ? 1 : 0;
        ans[S[i].second] += add;
        ans[S[j].second] += add;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << " \n"[i == n - 1];
  }
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
#ifdef LOCAL
  int T;
  cin >> T;
  for (int tc = 1; tc <= T; tc++) {
    cout << "Case" << tc << ":" << '\n';
    solve();
  }
#else
  solve();
#endif
  return 0;
}