#include<fstream>
#include<algorithm>
#include<cstring>
using namespace std;
int i, j, n, sol, p[36003];
char ch[36003][18], aux[18];
ifstream in("restante.in");
ofstream out("restante.out");

int cmp(int i, int j) {
    return strcmp(ch[i], ch[j])< 0;
}
int main(){
    in>>n;
    for(i=1; i<=n; i++){
        in>>ch[i];
        sort(ch[i], ch[i]+strlen(ch[i]));
        p[i] = i;
    }

    sort(p+1, p+n+1, cmp);
    for(i=1; i<=n; i++){
        if(strcmp(ch[p[i]], ch[p[i+1]])!=0)
            sol++;
    }
    out<<sol;
return 0;
}