Count how many distinct messages occur. A message may contain uppercase letters and spaces; comparison is exact.

Input

The first line contains n (1 ≤ n ≤ 10000). Each of the next n lines is a message of length 1 to 100.

Output

Print the number of distinct messages.

Examples

Input #1

4
HAPPY NEW YEAR
BEST WISHES
GOOD LUCK
HAPPY NEW YEAR

Output #1

3

Input #2

3
A B
A  B
A B

Output #2

2