#include<fstream>
#include<algorithm>
#include<cstring>
using namespace std;
int n, i, chn, p[36003], sol;
char ch[36003][20];
int cmp(int x, int y){
    return strcmp(ch[x]+1, ch[y]+1)<0;
}
ifstream in("restante.in");
ofstream out("restante.out");
int main(){
    in>>n;
    for(i=1; i<=n; i++){
        in>>ch[i]+1;
        chn=strlen(ch[i]+1);
        sort(ch[i]+1, ch[i]+chn+1);
        p[i]=i;
    }
    sort(p+1, p+n+1, cmp);
    for(i=1; i<=n; i++){
        if(strcmp(ch[p[i]]+1, ch[p[i+1]]+1)!=0 && strcmp(ch[p[i-1]]+1, ch[p[i]]+1)!=0)
            sol++;
    }
    out<<sol;
return 0;
}