RT

#include<bits/stdc++.h>
using namespace std;
const long long P=0x7fffffff;
long long n,hash[10011],p=41,cnt=1;
char s[10011];
unsigned long long hashme(char c[]){
	unsigned long long ans;
	for(unsigned long long i=0;i<strlen(c);i++)ans=ans*p+(unsigned long long)s[i];
	return ans&P;
}
int main(){
	
	scanf("%d",&n);
	for(unsigned long long i=1;i<=n;i++){
		scanf("%s",s);
		hash[i]=hashme(s);
	}
	sort(hash+1,hash+n+1);
	for(unsigned long long i=2;i<=n;i++)if(hash[i]!=hash[i-1])cnt++;
	printf("%d",cnt);
	return 0;
}