#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll 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 N_MAX = 2e5;

int main(){
    ll n;
    cin >> n;

    vector<string> s(n);
    rep(i, n) cin >> s[i];
    
    map<string, ll> mp;
    rep(i, n) mp[s[i]] = i;

    rep(i, n){
        ll cnt = 0;
        string tmp = "";
        rep(j, (ll)s[i].size()) tmp+=s[i][j];

        rep(j, (ll)s[i].size()){
            rep(k, 26){
                if(s[i][j]-'a' == k) continue;
                tmp[j] = 'a'+k;
                if(mp.find(tmp) != mp.end()){
                    cnt++;
                }
            }
            tmp[j] = s[i][j];
        }

        cout << cnt << endl;
    }
}