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

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

int main(){
  int N,count=1;
  char S[N_MAX][11];
  scanf("%d",&N);
  for(int a=0;a<N;a++)scanf("%s",S[a]);
  qsort(S,N,sizeof(S[0]),upordown);
  for(int a=0;a<N-1;a++){
    if(0!=strcmp(S[a],S[a+1]))count++;
  };
  printf("%d",count);
};