#Q62. 「一本通 2.4 练习 3」单词

「一本通 2.4 练习 3」单词

Description

Original source: TJOI 2013

A person is reading a paper, which is composed of many words. However, they notice that certain words appear frequently in the paper. Now, they want to know how many times each word appears in the paper.

Input Format

The first line contains an integer NN, indicating the number of words. The following NN lines each contain one word.

Output Format

Output NN integers, where the ii-th integer represents the number of times the ii-th word appears in the paper.

Sample 1

3
a
aa
aaa

6
3
1

Constraints and Hints

For all test cases, 1N2001\le N\le 200, the total length of all words does not exceed 10610^6, and each word consists of lowercase letters only.