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>

struct styp {
   char t[11];
} ;

int asc(const void *a, const void *b) {
  return strcmp((*(struct styp *)a).t,(*(struct styp *)b).t);
}

int main(){
   int i,n,ans;
   struct styp s[200000];
   char last[11];

   scanf("%d",&n);
   for (i=0;i<n;i++) scanf("%s",s[i].t);
   qsort(s,n,sizeof(struct styp),asc);

   strcpy(last,(char *)(&s[0]));
   for (ans=i=1;i<n;i++)
      if (strcmp(last,(char *)(&s[i]))!=0) {
         strcpy(last,(char *)(&s[i]));
         ans++;
      }
   printf("%d\n",ans);
   return 0;
}