rt,本地测可以过样例，提交CE

#include<bits/stdc++.h>
#define int long long
#define base 131
#define PRIME 233317
using namespace std;
unsigned long long mod=212370440130137957;
int n,a[100005],ans=1;
string s;
int hash(string s)
{
	int y=s.size();
	int sum=0;
	for(int i=0;i<y;i++)
		sum=(sum*base+(int)s[i])%mod+PRIME;
	return sum;
}
signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>s;
		a[i]=hash(s);
	}
	sort(a+1,a+n+1);
	for(int i=2;i<=n;i++)
		if(a[i]!=a[i-1])
			ans++;
	cout<<ans;
}