|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||256 MB||0||0||0||0.000%|
Vasya is a system administrator of a new social network, named Five Contacts or just V Contacts. High security is very important in social networks. One of the problems is spammers, who can steal users’ passwords and send spam messages or do other bad things.
According to security policy of V Contacts each password consists of five lowercase or uppercase English letters or digits. Vasya wants to analyze a database of all users’ passwords in order to know its security level. The security level depends on how many pairs of passwords are the same, differ in one position, two positions, etc.
The first line of the input file contains one integer number n — the total number of users of V Contacts (1 ≤ n ≤ 50 000).
Each of the following n lines contains a single user password.
The output file should contain six numbers ai (0 ≤ i ≤ 5) — the number of pairs of passwords which are different in exactly i positions.
3 abcde ABCDE 12345
0 0 0 0 0 3
7 aaaaa aaaaa aaaa1 aaaA2 aaBCD a6543 XxXxX
1 2 3 4 5 6