#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>

#define rep(i,n) for(i=0; i<n; ++i)
#define inc_rep(i,a,n) for(i=a; i<n; ++i)
#define dec_rep(i,n,a) for(i=n; i>=a; --i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
#define print_vec(v) for(auto it=v.begin();it!=v.end();++it)cout<<*it <<" ";cout<<endl
#define print_vec2d(v) for(int i=0;i<v.size();++i){for(int j=0;j<v[i].size();++j)cout<<v[i][j]<<" ";cout<<endl;}cout<<endl
using namespace std;
using lint = long long;


int main(void){
    lint i, j, k, cnt=0, x, y;
    lint p, q, n, m;
    in(n);
    vector<string> s(n);
    rep(i,n) in(s[i]);
    vector<lint> count(n,0);
    rep(i,n-1){
        inc_rep(j,i+1,n){
            if(s[i].size()==s[j].size()){
                // out(i,endl);
                cnt=0;
                rep(k,s[i].size()){
                    if(s[i][k]!=s[j][k]) cnt++;
                }
                if(cnt==1){
                    count[i]++; count[j]++;
                }
            }
        }
    }
    rep(i,n){
        out(count[i],endl);
    }

    return 0;
}