import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MAX_L = 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto S = new string[N];
      foreach (i; 0 .. N) {
        S[i] = readToken;
      }
      
      alias Entry = Tuple!(string, "key", int, "i");
      Entry[][MAX_L + 1][MAX_L + 1] esss;
      foreach (i; 0 .. N) {
        const len = cast(int)(S[i].length);
        foreach (x; 0 .. len) {
          esss[len][x] ~= Entry(S[i][0 .. x] ~ S[i][x + 1 .. len], i);
        }
      }
      auto ans = new int[N];
      foreach (l; 0 .. MAX_L + 1) {
        foreach (x; 0 .. l) {
          auto es = esss[l][x];
          es.sort;
          const esLen = cast(int)(es.length);
          for (int j = 0, k; j < esLen; j = k) {
            for (k = j; k < esLen && es[j].key == es[k].key; ++k) {}
            foreach (ref e; es[j .. k]) {
              ans[e.i] += (k - j - 1);
            }
          }
        }
      }
      
      foreach (i; 0 .. N) {
        writeln(ans[i]);
      }
      debug {
        writeln("========");
      }
    }
  } catch (EOFException e) {
  }
}