#include <cstdio>
#include <algorithm>

using namespace std;
int v[36001];
int main()
{
    FILE *fin=fopen ("restante.in","r");
    FILE *fout=fopen ("restante.out","w");
    int n,i,nr,uni,st;
    char c;
    fscanf (fin,"%d\n",&n);
    for (i=1;i<=n;i++){
        c=fgetc (fin);
        nr=0;
        while (c!='\n'){
            nr=nr+(1<<(c-'a'));
            c=fgetc (fin);
        }
        v[i]=nr;
    }
    sort (v+1,v+n+1);
    uni=0;
    st=0;
    for (i=1;i<=n;i++){
        if (v[i]!=v[i-1]){
            uni++;
            st=0;
        }
        else if (st==0){
            st=1;
            uni--;
        }
    }
    fprintf (fout,"%d",uni);
    return 0;
}