#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, ans;
    char c;
    cin >> N;
    vector<string> S(N);
    map<string, int> mp;

    for (int i=0; i<N; i++){
        cin >> S[i];
        mp[S[i]]++;
    }

    for (int i=0; i<N; i++){
        ans = 0;
        for (int j=0; j<S[i].size(); j++){
            for (int k=0; k<26; k++){
                c = S[i][j];
                if (c == 'a'+k) continue;
                S[i][j] = 'a'+k;
                ans += mp[S[i]];
                S[i][j] = c; 
            }
        }
        cout << ans << endl;
    }

    return 0;
}