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: Runtime Error)

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#define rep(i,n) for(i=0;i<n;i++)
#define PI 3.14159265358979323846264338327950L
int main(){
    int i,n;
        scanf("%d",&n);
    char a[n][10],tmp[20];
    rep(i,n){
        scanf("%s",a[i]);
    }
    for(i=1;i<n;i++){
        for(int j=1;j<n;j++){
            if(strcmp(a[j],a[j-1])>0){
                strcpy(tmp,a[j]);
                strcpy(a[j],a[j-1]);
                strcpy(a[j-1],tmp);
            }
        }
    }
    int cnt=1;
    rep(i,n-1){
        if(strcmp(a[i],a[i-1])!=0) cnt++;
    }
    printf("%d",cnt);
    return 0;
}