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<math.h>
#include<string.h>
#define F(i,a,n) for(int i=a; i<n; i++)
typedef struct sssi{
  char s[20];
  int ss;
}sssi;

int compare(const void *b1, const void *b2){ // 昇順
  return strcmp(((sssi*)b1)->s,((sssi*)b2)->s);
}





int main(){
  int n;
  scanf("%d",&n);
  sssi sss[n];
  int count=0;
  F(i,0,n){
    scanf("%s",sss[i].s);
    sss[i].ss=strlen(sss[i].s);
  }
  qsort(sss,n,sizeof(sssi),compare);
  F(i,0,n-1){
    if(sss[i].ss==sss[i+1].ss && strcmp(sss[i].s,sss[i+1].s)==0){
      count++;
    }
  }
  printf("%d\n",n-count);
  
  return 0;
}