//
// Created by DELLPC on 24-4-21.
#include <bits/stdc++.h>

using namespace std;

const int maxn = 5e4 + 5;

string s[maxn];

int en(char c) {
    if(c == '/')
        return 0;
    if(c == '.')
        return 1;
    return c - 'a' + 2;
}

int nex[maxn * 50][30], cn[maxn];
int cnt = 1;

void insert(string ss) {
    int p = 1;
    int n = ss.size();
    for(int i = 0; i < n; i++) {
        if(!nex[p][en(ss[i])])
            nex[p][en(ss[i])] = ++cnt;
        p = nex[p][en(ss[i])];
        cn[p]++;
    }
}

int sol(string ss) {
    int p = 1;
    int n = ss.size();
    for(int i = 0; i < n; i++) {
        p = nex[p][en(ss[i])];
        if(cn[p] == 1) {
            return i + 1;
        }
    }
    return n;
}

int main() {
    int n;
    cin >> n;
    for(int i = 0; i < n; i++) {
        cin >> s[i];
        insert(s[i]);
    }
    for(int i = 0; i < n; i++) {
        cout << sol(s[i]) << endl;
    }
    return 0;
}