/*** WORK : 省赛\202icpc银川\k.cpp ***/
/*** TIME : 2024/12/28 16:03 ***/
#include <bits/stdc++.h>
using namespace std;
#define int long long

#define all(v) v.begin(), v.end()
#define eb emplace_back
#define se second
#define fi first
#define endl '\n'

using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;
using pii = pair<int,int>;using vpii = vector<pii>;using vvpii = vector<vpii>;
using mii = map<int,int>;using mpi = map<pii,int>;using si = set<int>;
istream& operator>>(istream& in,vi& a){for(int &x:a)in>>x;return in;}
ostream& operator<<(ostream& out,const vi& a){for(int x:a)out<<x<<" ";return out;}
const int INF = LLONG_MAX/4;const int MOD = (int)1e9 + 7;
const int MAXN = 2e5 + 5;


void solve()
{
    int n; cin >> n;
    unordered_set<string> s;
    int ans = 1;
    vector<string> a(n+1);
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    map<string,int> mp;
    for(int i=n;i>=1;i--){
        string cur = "";
        string tmp;
        int f = 1;
        for(char c:a[i]){
            cur += c;
            if(s.find(cur) == s.end() && f==1){
                tmp = cur;
                f = 0;
            }
            s.insert(cur);
        }
        a[i] = tmp;
        mp[tmp] = i;
    }
    vi dl(n+2,0);
    int now = 0;
    for(int i=1;i<=n;i++){
        
        now = now - dl[i] + 1;
        cout << now << endl;

        string cur = "";
        int t = -1;
        for(char c:a[i]){
            cur += c;
            if(mp.find(cur) != mp.end()){
                int tt = mp[cur];
                if(tt!=i)t = tt;
            }
        }
        if(t>0)dl[t]++;
    }
}

//a.b
//a.
//a

int32_t main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << fixed << setprecision(12);
    int T = 1;
    // cin >> T;/
    while (T--)
        solve();
}