Problem:
Score : 300 points

Problem Statement

You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.

How many kinds of items did you get?

Constraints

1 \leq N \leq 2\times 10^5

S_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print the number of kinds of items you got.

Sample Input 1

3
apple
orange
apple

Sample Output 1

2

You got two kinds of items: apple and orange.

Sample Input 2

5
grape
grape
grape
grape
grape

Sample Output 2

1

Sample Input 3

4
aaaa
a
aaa
aa

Sample Output 3

4

Solution in C (Clang 10.0.0) (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef long long ll;

int is_double(char s[100001][11], int n)
{
	int i = 0;
	while (i < n)
	{
		if (strcmp(s[i], s[n]) == 0)
			return 1;
		i++;
	}
	return 0;
}

int main()
{
	int N;
	scanf("%d", &N);
	char str[N][11];
	int i = 0;
	while (i < N)
		scanf("%s", str[i++]);
	int j;
	int n = 0;
	i = 0;
	while (i < N)
	{
		// j = ;
		// while (j < N)
		// {
		// 	if (strcmp(str[i], str[j]) == 0)
		// 		n++;
		// 	j++;
		// }
		if (is_double(str, i))
			n++;
		i++;
	}
	printf("%d", N - n);
	return (0);
}