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<stdlib.h>
#include<string.h>
#include<stdio.h>


int  fun(char *s)
{
	while(*s != '\0')
	{
		if(*s<'a'||*s>'z')
			return 0;
		s++;
	}
	return 1;
}

int fun2(char *x,char *y)
{
	int i = strlen(x)-1;
	int j = strlen(y)-1;
	while(*x++ == *y++ &&*x != '\0'&& *y != '\0'){
		i--;
		j--;
	}
		printf("i=%d,j=%d\n",i,j);
	if(i ==0 && j== 0)
		return 1;

	return 0;
}


int main()
{
	
	int N;
	scanf("%d",&N);
	char **S= (char **)malloc( N*sizeof(char)*11);
	int i;
	for(i=0;i<N;i++)
		S[i] = (char *)malloc(sizeof(char)*11);
	i =0;
	for(i=0;i<N;i++)
	{
		scanf("%s",S[i]);
		
	}
	int j,n;
	n=1;
	int flag;
	for(i=0;i<N;i++)
	{
		flag=1;
		for(j=0;j<N;j++)
		{
			if(fun2(S[j],S[i])&&j != i)
			{
				flag=0;
				break;
			}
		}
		if(flag && i!=0)
		{
			n++;
		}
	}
	printf("%d\n",n);
	return 0;

}