#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);
  for (int i = 0; i < n; i++) {
    string &s = S[i].first;
    int x = S[i].second;
    string t = s;
    int len = t.size();
    for (int j = 0; j < len; j++) {
      for (int k = 0; k < 26; k++) {
        char c = 'a' + k;
        if (c != s[j]) {
          t[j] = c;
          auto it = lower_bound(S.begin(), S.end(), make_pair(t, 0));
          while (it != S.end()) {
            int y = it->second;
            if (x != y && it->first == t) {
              ans[x]++;
            } else if (x != y) {
              break;
            }
            it++;
          }
        }
      }
      t[j] = s[j];
    }
  }

  for (int a : ans) {
    cout << a << '\n';
  }
}

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;
}