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

static inline void solve() {
  int n;
  cin >> n;
  vector<vector<pair<int, string>>> S(11);
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    S[s.size()].push_back({i, s});
  }
  vector<int> ans(n, 0);
  for (int len = 1; len <= 10; len++) {
    int m = S[len].size();
    for (int i = 0; i < m; i++) {
      string& a = S[len][i].second;
      int x = S[len][i].first;
      for (int j = i + 1; j < m; j++) {
        string& b = S[len][j].second;
        int y = S[len][j].first;
        int diffs = 0;
        for (int k = 0; k < len; k++) {
          if (a[k] != b[k]) {
            diffs++;
          }
        }
        if (diffs == 1) {
          ans[x]++;
          ans[y]++;
        }
      }
    }
  }
  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;
}