#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define N 50007
#define mp make_pair

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

int tot = 1;

struct node{bool tag, vis; int fa, tr[28];} c[3000007];

int Ans;

int insert(int *s, int len) {
    int nw = 1;
    for (int i = 1; i <= len; nw = c[nw].tr[s[i++]])
        if (!c[nw].tr[s[i]]) c[c[nw].tr[s[i]] = ++tot].fa = nw;
    return nw;
}

void del(int nw, int *s, int len) {
    while (nw != 1) {
        if (c[nw].tag) {c[nw].tag = false; --Ans;} // 若原本有标记则要撤销
        if (!c[nw].vis) { // 若第一次经过该点，则对所有其他儿子打标记
            c[nw].vis = true;
            for (int i = 0; i < 28; ++i)
                if (c[nw].tr[i] && !c[c[nw].tr[i]].vis) {++Ans; c[c[nw].tr[i]].tag = true;}
        }
        --len;
        nw = c[nw].fa;
    }
}

char S[N];

int s[N][60], pos[N];

int len[N], ans[N];

int main() {
    int n = rd();
    for (int i = 1; i <= n; ++i) {
        scanf("%s", S + 1);
        len[i] = strlen(S + 1);
        for (int j = 1; j <= len[i]; ++j) s[i][j] = trans(S[j]);
        pos[i] = insert(s[i], len[i]);
    }
    for (int i = 0; i < 28; ++i)
        if (c[1].tr[i]) {++Ans; c[c[1].tr[i]].tag = true;}
    ans[n] = Ans;
    for (int i = n; i; --i) {
        del(pos[i], s[i], len[i]);
        ans[i - 1] = Ans;
    }
    for (int i = 1; i <= n; ++i) printf("%d\n", ans[i]);
    return 0;   
}