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 (GCC 9.2.1) (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <stdbool.h>
#include <string.h>
 
int main(void) {
	int N;
	char tmp[11];
	char S[26][200000][12];
	int Snum[26] = {0};
	int first;
	int sum = 0;
	
	scanf("%d", &N);
	for(int i = 0; i < N; i++) {
		int j;
		
		scanf("%s", &tmp[0]);
		first = tmp[0]-'a';
		
		for(j = 0; j < Snum[first]; j++) {
			if(strcmp(&S[first][j][1], &tmp[1]) == 0)	{
				break;
			}
		}
		if( j == Snum[first] ) {
			strcpy(&S[first][j][0], tmp);
			Snum[first]++;
		}
	}
	
	for(int i = 0; i < 26; i++) {
		sum += Snum[i];
	}
	
	printf("%d\n", sum);
	
	return 0;
}