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

static inline void solve() {
  int n;
  cin >> n;
  vector<string> S(n);
  for (int i = 0; i < n; i++) {
    cin >> S[i];
  }
  unordered_map<string, int> count;
  for (string &s : S) {
    int m = s.size();
    string t = s;
    for (int j = 0; j < m; j++) {
      t[j] = '.';
      count[t]++;
      t[j] = s[j];
    }
  }
  vector<int> ans(n, 0);
  for (int i = 0; i < n; i++) {
    string& s = S[i];
    int m = s.size();
    string t = s;
    for (int j = 0; j < m; j++) {
      t[j] = '.';
      ans[i] += count[t] - 1;
      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;
}