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 <bits/stdc++.h>
#include <iostream>
#include <math.h>
#define rep(I,N) for(int I=0;I<N;I++)
using ll=long long int;
using namespace std;
int ans=0;
const int N = 200000;
int main(){
	ll n,m,k;
	cin>>n>>m>>k;
	ll a[n+1],b[m+1];
	a[0]=0;
	b[0]=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i]+=a[i-1];
	}
	for(int i=1;i<=m;i++){
		cin>>b[i];
		b[i]+=b[i-1];
	}
	for(int i=0;i<=n;i++){
		if(k<a[i])continue;
       	int j=m;
		for(int j=4;k<a[i]+b[j];j--);
          ans=max(ans,i+j);
        
      //ans=max(ans,i+j);
     
	}
cout<<ans<<endl;
}