#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (int i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int N; cin >> N;
    vector<string> S(N); rep(i, N) cin >> S[i];

    unordered_map<string, int> mp; rep(i, N) mp[S[i]]++;

    rep(i, N){
        int ans = 0;
        rep(j, (int)S[i].size()) rep(c, 26) if((S[i][j]-'a')!=c){
            char tmp = S[i][j];
            S[i][j]=(char)('a'+c);
            ans += mp[S[i]];
            S[i][j]=tmp;
        }
        cout << ans << '\n';
    }
}