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>
int main(){
  int n;
  int i=0;
  scanf("%d", &n);
  char s1[100], s2[100];
  int count=0;
  scanf("%s", s1);
  for(int j=0;j<n-1;++j){
      scanf("%s", s2);
  while(s1[i]!='\0' || s2[i]!='\0'){
      if(s1[i]!=s2[i]){
        count++;
        for(int k=0;k<i;++k){
          s1[k]=s2[k];
        }
      break;
    }
    i++;
  }
}
  printf("%d", count+1);
  return 0;
}