#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 1E5 + 10;

int parent[N];
int dep[N];
int deg[N];
int cur[N];

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    std::vector<std::string> s(n);
    for (int i = 0; i < n; i++) {
        std::cin >> s[i];
    }
    
    std::vector<int> p(n);
    std::iota(p.begin(), p.end(), 0);
    std::sort(p.begin(), p.end(),
        [&](int i, int j) {
            return s[i] < s[j];
        });
    
    int tot = n;
    std::vector<int> a{p[0] + 1};
    dep[p[0] + 1] = s[p[0]].size();
    for (int i = 1; i < n; i++) {
        int l = 0;
        while (s[p[i - 1]][l] == s[p[i]][l]) {
            l++;
        }
        while (a.size() > 1 && dep[a[a.size() - 2]] >= l) {
            parent[a.back()] = a[a.size() - 2];
            a.pop_back();
        }
        if (dep[a.back()] > l) {
            int v = ++tot;
            dep[v] = l;
            parent[a.back()] = v;
            a.back() = v;
        }
        a.push_back(p[i] + 1);
        dep[p[i] + 1] = s[p[i]].size();
    }
    
    while (a.size() > 1) {
        parent[a.back()] = a[a.size() - 2];
        a.pop_back();
    }
    
    // for (int i = 1; i <= tot; i++) {
    //     std::cerr << parent[i] << " \n"[i == tot];
    // }
    
    int rt = a[0];
    for (int i = 1; i <= tot; i++) {
        if (i != rt) {
            deg[parent[i]]++;
        }
    }
    if (!dep[rt]) {
        cur[rt] = -1;
    }
    
    int ans = 0;
    for (int i = 0; i < n; i++) {
        ans++;
        int u = i + 1;
        u = parent[u];
        while (u) {
            cur[u]++;
            if (cur[u] == deg[u]) {
                ans += 1 - deg[u];
            } else {
                break;
            }
            u = parent[u];
        }
        std::cout << ans << "\n";
    }
    
    return 0;
}