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 <string.h>

int main(){
  int n;
  scanf("%d",&n);
  char s[11];
  char save[n][11];
  int i,j;
  int cnt=1;
  int flag=0;
  scanf("%s",s);
  strcpy(save[0], s);

  for(i=1;i<n;i++){
      scanf("%s",s);
      flag=0;
      for(j=1;j<=cnt;j++){
        if(strcmp(s,save[j-1])==0){
          flag=1;
        }
      }
      if((flag==0) && (cnt<=n)){
        cnt=cnt+1;
        strcpy(save[cnt],s);
      }
  }

  printf("%d\n",cnt);

  return 0;
}