#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))

#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

struct node
{
	int nxt[28];
	int cnt;
	VI v;
	
	node()
	{
		FILL(nxt, -1);
		cnt = 0;
	}
};

const int MAX = 3e6;
const int N = 1e5;
bool used[N];
int ans[N];

void del(int x, int j)
{
	if (!used[x])
	{
		ans[j]++;
	}
	used[x] = 1;
}

struct trie
{
	node t[MAX];
	int sz = 1;
	
	void add(string s)
	{
		int v = 0;
		int n = SZ(s);
		FOR (i, 0, n)
		{
			t[v].cnt++;
			int j = s[i] - 'a';
			if (t[v].nxt[j] == -1)
				t[v].nxt[j] = sz++;
			v = t[v].nxt[j];
		}
		t[v].cnt++;
	}
	
	void erase(string s)
	{
		int v = 0;
		FOR (i, 0, SZ(s))
		{
			t[v].cnt--;
			v = t[v].nxt[s[i] - 'a'];
		}
		t[v].cnt--;
	}
	
	void f(string s, int k)
	{
		int v = 0;
		int n = SZ(s);
		FOR (i, 0, n)
		{
			if (t[v].cnt == 0 && i != 0) break;
			
			t[v].v.PB(k);
			int j = s[i] - 'a';
			v = t[v].nxt[j];
		}
		assert(t[v].cnt == 0);
		FOR (i, 0, SZ(t[v].v))
			del(t[v].v[i], k);
		t[v].v.clear();
		t[v].v.PB(k);
	}
} T;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	
	vector<string> v(n);
	FOR (i, 0, n)
	{
		cin >> v[i];
		FOR (j, 0, SZ(v[i]))
		{
			if (v[i][j] == '.') v[i][j] = 'z' + 1;
			if (v[i][j] == '/') v[i][j] = 'z' + 2;
		}
		T.add(v[i]);
	}
	FOR (i, 0, n)
	{
		T.erase(v[i]);
		T.f(v[i], i);
		if (i)
			ans[i] += ans[i - 1];
		cout << (i + 1) - ans[i] << '\n';
	}
	
	
}