#include <bits/stdc++.h>   using namespace std;   char s[410][42];   char a[42], t[42];   int main() {     int n;     while (~scanf( %d , &n)) {       int ans = n, g = 0;       for (int k = 0; k < n; k++) {         scanf( %s , t);         while (true) {           int k = 0;           for (int i = 0; t[i] !=   0 ;) {             if (t[i] ==  u )               a[k++] =  o , a[k++] =  o , i++;             else if (t[i] ==  k ) {               int num = -1;               for (int j = i; t[j] !=   0 ; j++) {                 if (t[j] ==  k )                   continue;                 else if (t[j] ==  h ) {                   num = j + 1;                   break;                 } else                   break;               }               if (num == -1)                 a[k++] =  k , i++;               else                 a[k++] =  h , i = num;             } else               a[k++] = t[i], i++;           }           a[k] =   0 ;           if (strcmp(a, t) == 0)             break;           else             strcpy(t, a);         }         bool flag = false;         for (int j = 0; j < g; j++)           if (strcmp(s[j], t) == 0) {             ans--;             flag = true;             break;           }         if (!flag) strcpy(s[g++], t);       }       printf( %d n , ans);     }     return 0;   }   