#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
  int n;
  cin >> n;
  vector<string> vs(n);
  map<string, int> mp;
  for(int i = 0; i < n; i++) {
    cin >> vs[i];
    mp[vs[i]]++;
  }
  vector<int> ans(n, 0);
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < vs[i].size(); j++) {
      string tmp = vs[i];
      for(int k = 0; k < 26; k++) {
        if(vs[i][j] == (char)(k + 'a')) {
          continue;
        }
        tmp[j] = (char)(k + 'a');
        ans[i] += mp[tmp];
      }
    }
  }
  for(int i = 0; i < n; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}