A. Aliases
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are designing a new system called NAME (Notable Aliases with Meaning and Essence) that transforms people's names into meaningful aliases. The process involves taking the first letter of each name.

For example, the name "Jose Osorio Jimenez Orozco" would have the NAME "JOJO".

However, a problem arises if two people have the same NAME, as it loses its essence and is no longer unique.

Given a list of full names for all the members, your task is to determine how many unique NAMEs there are.

Input

An integer $$$N$$$ describes the number of names of the members ($$$1 \leq N \leq 10000$$$). Following will be $$$N$$$ lines, each one starting with an integer $$$X_i$$$ ($$$1 \leq X_i \leq 20$$$) describing total words in the full name of the person $$$i$$$, following that there will be $$$X_i$$$ words representing the name of the person $$$i$$$. Each word is consisting on only lowercase letters.

Output

A single integer representing the number of uniques NAMEs

Examples
Input
2
2 ivan ramirez
2 franco borquez
Output
2
Input
3
4 jose osorio jimenez orozco
4 juan orlando jay ocampo
2 juan perez
Output
1