#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>

using namespace std;

const int N = 5e6 + 5;

vector <string> v;

int trie[N][30];
int coun[N],sum[N];
int n,cnt,ans;

int get_id(char c)
{
	if(c == '/') return 26;
	if(c == '.') return 27;
	return c - 'a';
}

void insert(string s)
{
	int root = 0;
	int len = s.size();
	for(int i = 0;i < len;i ++)
	{
		int id = get_id(s[i]);
		if(trie[root][id] == 0)
		{
			trie[root][id] = ++ cnt;
		}
		sum[trie[root][id]] ++;
		root = trie[root][id];
	}
}

void find(string s)
{
	int root = 0;
	int len = s.size();
	vector <int> p;
	for(int i = 0;i < len;i ++)
	{
		int id = get_id(s[i]);
		sum[trie[root][id]] --;
		if(sum[trie[root][id]] == 0)
		{
			int dif = 1 - coun[trie[root][id]];
			ans += dif;
			for(int j = 0;j < p.size();j ++)
			{
				coun[p[j]] += dif;
			}
			return;
		}
		root = trie[root][id];
		p.push_back(root);
	}
}

int main()
{
	scanf("%d",&n);
	for(int i = 1;i <= n;i ++)
	{
		string s;
		cin >> s;
		v.push_back(s);
		insert(s);
	}
	for(int i = 0;i < n;i ++)
	{
		find(v[i]);
		printf("%d\n",ans);
	}
	return (0 ^ 0);
}