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: Accepted)

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

int		compare_string(const void *a, const void *b)
{
	return strcmp(*(const char **)a, *(const char **)b);
}

int main()
{
	long N;
	scanf("%ld", &N);
	char **str;
	long i = 0;

	str = (char**)malloc(sizeof(char*) * N);
	while (i < N)
	{
		str[i] = (char*)malloc(sizeof(char) * 11);
		scanf("%s", str[i]);
		i++;
	}
	long n = 0;
	qsort(str, N, sizeof *str, compare_string);

	i = 0;
	while (i < N - 1)
	{
		// printf("%s ", str[i]);
		if (strcmp(str[i], str[i + 1]) != 0)
			n++;
		i++;
	}
	printf("%ld", n + 1);
	return (0);
}