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 <string.h>
#include <stdlib.h>

int main(){
	int n;
	char **s;
	int num;
	scanf("%d", &n);
	s = malloc(n * sizeof(char*));
	for(int i=0; i<n; i++){
		s[i]=malloc(11*sizeof(char));
		for(int j=0;j<11;j++){
			s[i][j]=0;
		}
	}
	num = 0;
	for(int i=0; i<n; i++){
		char tmp[11];
		scanf("%s", tmp);
		for(int j=0; j<=i; j++){
			if (strcmp(tmp, s[j])==0){
				break;
			}
			if (num == j){
				strcpy(s[num], tmp);
				num++;
				break;
			}
		}
	}
	printf("%d", num);
	return (0);
}