1 #include <algorithm>
 2 #include <iostream>
 3 #include <cstring>
 4 #include <cstdio>
 5 
 6 #define ull unsigned long long
 7 #define base1 1499
 8 #define base2 1493
 9 
10 using namespace std;
11 
12 const int N(10000+15);
13 char s[N];
14 ull n;
15 struct Node
16 {
17     ull hash1,hash2;
18 }node[N];
19 
20 ull Get_hash1(char a[],ull len)
21 {
22     ull ret=1;
23     for(int i=0;i<len;i++)
24         ret=ret*base1+(a[i]-‘0‘);
25     return ret;
26 }
27 
28 ull Get_hash2(char a[],ull len)
29 {
30     ull ret=1;
31     for(int i=0;i<len;i++)
32         ret=ret*base2+(a[i]-‘0‘);
33     return ret;
34 }
35 
36 bool cmp(Node a,Node b)
37 {
38     
39     return a.hash1<b.hash1;
40 }
41 
42 int main()
43 {
44     scanf("%d",&n);
45     for(int i=1;i<=n;i++)
46     {
47         scanf("%s",s);
48         node[i].hash1=Get_hash1(s,strlen(s));
49         node[i].hash2=Get_hash2(s,strlen(s));
50     }
51     sort(node+1,node+n+1,cmp);
52     int ans=1;
53     for(int i=2;i<=n;i++)
54         if(node[i].hash1==node[i-1].hash1&&node[i].hash2==node[i-1].hash2) continue;
55         else ans++;
56     printf("%d\n",ans);
57     return 0;
58 }