local n = io.read("*n", "*l")
local s = {}
local lenmap = {}
local ans = {}
local tmp = {}
for i = 1, n do
  ans[i] = 0
  tmp[i] = ""
  s[i] = io.read()
  local len = #s[i]
  if not lenmap[len] then lenmap[len] = {} end
  table.insert(lenmap[len], i)
end

for len, tbl in pairs(lenmap) do
  local sidx = {}
  for i = 1, #tbl do
    local idx = tbl[i]
    table.insert(sidx, idx)
  end
  for pos = 1, len do
    for i = 1, #tbl do
      local idx = tbl[i]
      if pos == 1 then
        tmp[idx] = s[idx]:sub(2, len)
      elseif pos == len then
        tmp[idx] = s[idx]:sub(1, len - 1)
      else
        tmp[idx] = s[idx]:sub(1, pos - 1) .. s[idx]:sub(pos + 1, len)
      end
    end
    table.sort(sidx, function(a, b) return tmp[a] < tmp[b] end)
    local left = 1
    for i = 1, #tbl - 1 do
      local i1, i2 = sidx[i], sidx[i + 1]
      if tmp[i1] ~= tmp[i2] then
        local z = i - left
        for j = left, i do
          ans[sidx[j]] = ans[sidx[j]] + z
        end
        left = i + 1
      end
    end
    do
      local z = #tbl - left
      for j = left, #tbl do
        ans[sidx[j]] = ans[sidx[j]] + z
      end
    end
  end
end
print(table.concat(ans, "\n"))