#include <bits/stdc++.h>

/* Orther */
// #define int long long
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define IOS ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
using namespace std;

/* Pair */
#define x first
#define y second

/* Data type */
using ll = long long;
using ull = unsigned long long;
using PII = pair<int,int>;
using VI = vector<int>;
using VPII = vector<PII>;

/* STL */
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define all1(x) x.begin()+1,x.end()

/* Random */
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define random(a,b) rng()%(b-a+1)+a

/* Contest */
const int INF = 0x3f3f3f3f , LLONGMAX = 1e18 ; // 1e9
const int MOD =  998244353 ;
const int N = 2e6 + 10, M = 55;

int tree[N][28] , cnt[N] , sz[N] , idx , n , fa[N];

int get(char c) {
	if(c >= 'a' && c <= 'z') return c - 'a';
	if(c == '.') return 26;
	if(c == '/') return 27;
}

void insert(string s){
	int p = 0 , n = s.size();
	for(int i = 0 ; i < n ; i ++){
		int c = get(s[i]);
		if(!tree[p][c]) tree[p][c] = ++ idx;
		fa[tree[p][c]] = p;
		p = tree[p][c];
		cnt[p] ++ ;
	}
}

void query(string s , int& res) {
	int p = 0 , n = s.size();
	for(int i = 0 ; i < n ; i ++) {
		int c = get(s[i]); 
		p = tree[p][c];
		cnt[p] -- ; // 发布就 --
		if(!cnt[p]) { // 如果 p 是答案
			int val = sz[p];
			res += 1 - val; // 剪掉之前的全部前缀 
			while(fa[p]) { // 把所有父节点全部变化
				sz[fa[p]] += (1 - val) ;
				p = fa[p]; 
			}
			break;
		}
	}
}

void Rainbow_()
{
    int n; cin >> n ;
    vector<string> v; string s;
    for (int i = 1; i <= n; i ++ ) {
    	cin >> s;
    	insert(s) , v.pb(s);
    }
    
    int ans = 0;
    for (auto tmp : v) {
    	query(tmp, ans);
    	cout << ans << '\n';
    }
}
 
signed main()
{   
    IOS;
    int _ = 1;
    // cin >> _;
 
    while ( _ -- ) 
        Rainbow_();
 
    return 0;
}