#include <bits/stdc++.h>
using namespace std;
int n;
char a[10005];
unsigned long long hasha[10005];
int ans = 1;
unsigned long long h(char k[]){
int l = strlen(k);
unsigned long long sum = 0;
for(int i = 0; i < l; ++i) sum = ((unsigned long long)k[i] + 1711) * 54581 % 1315423911;
return sum;
}
int main(){
scanf("%d",&n);
for(int i = 0; i < n; ++i){
scanf("%s",a);
hasha[i] = h(a);
}
sort(hasha + 1,hasha + n + 1);
for(int i = 1; i < n; i++){
if(hasha[i] != hasha[i + 1]) ans ++;
}
printf("%d\n",ans);
return 0;
}