#include <stdio.h>
long long int b[200005];
void merging(long long int a[],int low, int mid, int high) {
   int l1, l2, i;

   for(l1 = low, l2 = mid + 1, i = low; l1 <= mid && l2 <= high; i++) {
      if(a[l1] <= a[l2])
         b[i] = a[l1++];
      else
         b[i] = a[l2++];
   }
   
   while(l1 <= mid)    
      b[i++] = a[l1++];

   while(l2 <= high)   
      b[i++] = a[l2++];

   for(i = low; i <= high; i++)
      a[i] = b[i];
}

void sort(long long int a[],int low, int high) {
   int mid;
   
   if(low < high) {
      mid = (low + high) / 2;
      sort(a,low, mid);
      sort(a,mid+1, high);
      merging(a,low, mid, high);
   } else { 
      return;
   }   
}
int main()
{
    int t,a;
    scanf("%d",&t);
    char s[12];
    long long int x[t],num;
    for(int i=0;i<t;i++)
    {
        scanf("%s",s);num=0;
        for(int j=0;s[j]!='\0';j++)
        {
            a=s[j]-'a';
            num=num*100+(a+1);
        }
        x[i]=num;
    }
    sort(x,0,t-1);
    num=x[0];int count=1;
    for(int i=0;i<t;i++)
    {
        if(x[i]!=num)
        {
            count++;
            num=x[i];
        }
    }

    printf("%d",count);
}
