#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int n;
string S[500010];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n;
    map<pair<string,string>,int>mp;
    rep(i,n){
        cin>>S[i];
        int l=S[i].size();
        rep(j,l){
            mp[make_pair(S[i].substr(0,j),S[i].substr(j+1,l-j+1))]++;
        }
    }
    rep(i,n){
        int l=S[i].size(),cnt=0;
        rep(j,l){
            cnt+=mp[make_pair(S[i].substr(0,j),S[i].substr(j+1,l-j+1))];
        }
        cnt-=l;
        cout<<cnt<<"\n";
    }
}