#if !__INCLUDE_LEVEL__

#include __FILE__
ll llpow(ll x, ll n) {
  if (n == 0) return 1;
  ll val = llpow(x, n / 2);
  val *= val;
  if (n % 2 == 1) val *= x;
  return val;
}
int main()
{
    ll N;cin >> N;
    vector<string> S(N);rep(i,N)cin >> S[i];
    unordered_map<ll,ll> Hash; 
    fore(Si,S){
        ll L = Si.size();
        ll h = 0;
        ll t = 1;
        rep(l,L){
            h+=t*alpN(Si[l]);
            t*=28;
        }
        t=1;
        rep(l,L){
            h-=t*alpN(Si[l]);
            h+=t*27;
            Hash[h]+=1;
            h-=t*27;
            h+=t*alpN(Si[l]);
            t*=28;
        }
    }
    fore(Si,S){
        ll L = Si.size();
        ll h = 0;
        ll t = 1;
        rep(l,L){
            h+=t*alpN(Si[l]);
            t*=28;
        }
        t=1;
        ll ans = 0;
        rep(l,L){
            h-=t*alpN(Si[l]);
            h+=t*27;
            ans+=Hash[h]-1;
            h-=t*27;
            h+=t*alpN(Si[l]);
            t*=28;
        }
        cout << ans << endl;
    }
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define range(i, m, n) for(int i = m; i < n; i++)
#define fore(i,a) for(auto &i:a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Sum(v) accumulate(all(v),0)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
const ll INF = 1e16;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll SN(char s){return ll(s-'0');}
ll SN(string s){return stoll(s);}
int alpN(char s){return int(s-'a');}
int AlpN(char s){return int(s-'A');}
using Graph = vector<vector<ll>>;
using GraphCost = vector<vector<pair<ll,ll>>>;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using pll = pair<long long, long long>;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){for(int i=0;i<(int)v.size();i++)o<<(i>0?" ":"")<<v[i];return o;}//vector空白区切り出力
ostream& operator<<(ostream& os, const mint1& N) {return os << N.val();}//mint出力。デフォはmint1
ostream& operator<<(ostream& os, const mint2& N) {return os << N.val();}
template<class T> bool contain(const std::string& s, const T& v) {
    return s.find(v) != std::string::npos;
}
ll max(int x,ll y){return max((ll)x,y);}
ll max(ll x,int y){return max(x,(ll)y);}
ll min(int x,ll y){return min((ll)x,y);}
ll min(ll x,int y){return min(x,(ll)y);}
#endif