#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
typedef long long ll;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1int;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;
 
#define MOD 1000000007

ll dp[1<<20];

int main() {
  clr(dp,0);
  ll n;
  cin>>n;
  vector<string> vs;
  rep(i,0,n){
    string s;
    cin>>s;
    vs.pb(s);
  }
  sort(all(vs));
  rep(i,0,1<<n){
    vector<string> v;
    rep(j,0,n){
      if(((i>>j)&1)==0){
        v.pb(vs[j]);
      }
    }
    vector<ll> v1;
    rep(j,0,v.sz){
      ll mx = 1;
      rep(k,0,v.sz){
        if(j==k)continue;
        rep(l,0,min(v[j].sz,v[k].sz)){
          if(v[j][l]==v[k][l]){
            mx = max(mx,l+2);
          }
        }
      }
      v1.pb(mx);
    }
    ll index = 0;
    rep(j,0,n){
      if(((i>>j)&1)==0){
        dp[i|(1<<j)]+=dp[i]+v1[index];
        index++;
      }
    }
  }
  ll d[22];
  clr(d,0);
  rep(i,0,1<<n){
    ll a = 0;
    rep(j,0,n){
      if(((i>>j)&1)==1){
        a++;
      }
    }
    d[a]+=dp[i];
  }
  rep(i,0,n){
    cout << d[i+1] << endl;
  }
  return 0;
}