#include<bits/stdc++.h>
using namespace std;
const int N = 5e4 + 10;
int idx = 0,tr[N * 50][28],cnt[N * 50];
static int get(char c) {
	if (c <= 'z' && c >= 'a')return c - 'a';
	if (c == '.')return 26;
	return 27;
}
void insert(const string &x, int i) {
	int p = 0;
	for (auto v: x) {
		int u = get(v);
		if (!tr[p][u])tr[p][u] = ++idx;
		p = tr[p][u];
		cnt[p] = max(cnt[p], i);
	}
}
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n;
	cin >> n;
	vector<string> s(n + 1);
	for (int i = 1; i <= n; i++)  cin >> s[i];
	for (int i = 1; i <= n; i++)insert(s[i], i);
	vector<int> d(n + 2);
	for (int i = 1; i <= n; i++) {
		int p = 0;
		d[i]++;
		int last = n + 1;
		for (auto j: s[i]) {
			int u = get(j);
			p = tr[p][u];
			if (cnt[p] <= i) break;
			last = cnt[p];
		}
		d[last]--;
	}
	for (int i = 1; i <= n; i++) d[i] += d[i - 1];
	for (int i = 1; i <= n; i++) {
		cout << d[i] << endl;
	}
	return 0;
}