该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Statement

Timothy was an extraordinary visionary! In a short period of time, he conceived a vast number of web pages and made significant contributions to JSUT's Online Judge. However, the sheer number of directories in JSUT's Online Judge made it difficult for his assistant, Paper, to keep up. This was due to the sheer number of folders required, some of which were nested within folders. These folders are represented using Unix paths, for example: $\verb!/jsut/application/controller!$ indicates that under the root directory $/$, there is a folder named $\verb!jsut!$, which in turn contains a folder named $\verb!application!$, which in turn contains a folder named $\verb!controller!$.

Currently, the root directory^[1] is empty. Timothy has a lot of folder path names in mind. The question is, how many folders should he create to ensure they all exist?

Input

The first line is a positive integer $N(1\leq N\leq 10^3)$.

The next $N$ lines, each line is a string $s$ describing the path, and the length of $s$ does not exceed $100$.

Output

The output should contain $N$ lines, each containing $1$ positive integers. The $i$th line outputs the minimum number of new folders that need to be created in order for the $1$st path to the $i$th path to exist.

Samples

2
/jsut/application/controller
/jsut/application/view

3
4

3
/chicken
/chicken/egg
/chicken

1
2
2

4
/a
/a/b
/a/c
/b/b

1
2
3
5

Notes

The first character of each path is always $\verb!/!$, there are no two consecutive $\verb!/!$, and the last character is not $\verb!/!$. All names contain only digits and lowercase letters.