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>
#include <math.h>
#include <stdlib.h>
#include <ctype.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
	
#define MOD 1000000007

typedef long long ll;

int main(){
	int i, j, n, ans=1;
	scanf("%d",&n);
	char s[n][10];
	rep(i,n) scanf("%s",s[i]);
	for(i=1;i<n;i++) {
		for(j=0;j<i;j++){
			if(strcmp(s[i],s[j])==0) break;
			else if(strcmp(s[i],s[j])!=0&&i==j+1) ans++;
		}
	}
	printf("%d",ans);
}