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

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

int compare(const void *a, const void *b){//qsort引数用の比較関数(-1,0,1のいずれかを返すものに限る)
	return (strcmp((char *)a, (char *)b));//aのほうが辞書的に小さいとき負、大きいとき正、等しいとき0を返す
}

int main(){
	int N,i,count=0;
	char s[200001][11];

	scanf("%d", &N);

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

	qsort(s, N, sizeof(*s), compare);//ソートしたい配列・要素数・要素の単位サイズ・比較用関数

	for(i=0; i<N; i++){
		if(strcmp(s[i], s[i+1])!=0) count++;
	}

	printf("%d", count);
	return 0;

}