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: Wrong Answer)

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>

#define N_MAX 200000

int compare_char(const void* left, const void* right) {
    char *left_char = (char *)left;
    char *right_char = (char *)right;

    return strcmp( left_char, right_char );
}


int main(void){

	char s[N_MAX][10];
	char buff[11];
	int n;
	int len;
	int num;
	int i,j;
	long long int ret = 1;


	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%s",s[i]);
	}

	qsort(s, n, sizeof(s[0]), compare_char);


//	for(i=0;i<n-1;i++){
//		for(j=i+1;j<n;j++){
//			if(strncmp(s[i],s[j],10)==1){
//				strncpy(buff,s[i],10);
//				strncpy(s[i],s[j],10);
//				strncpy(s[j],buff,10);
//			}
//		}
//	}

	for(i=0;i<n-1;i++){
		if(strcmp(s[i],s[i+1])!=0){
			ret++;
		}
	}

	printf("%lld\n",ret);



	return 0;
}