#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;

int n,i,sol;
int v[36005];
char s[36005][20];

bool cmp(int a, int b){
    return (strcmp(s[a],s[b])<0);
}

int main(){

    ifstream f("restante.in");
    ofstream g("restante.out");
    f>>n;
    f.get();
    for(i=1;i<=n;i++){
        f.get(s[i],20);
        sort(s[i],s[i]+strlen(s[i]));
        f.get();
        v[i]=i;
    }
    sort(v+1,v+n+1,cmp);
    for(i=1;i<=n;i++)
    if(strcmp(s[v[i]],s[v[i-1]])!=0 && strcmp(s[v[i]],s[v[i+1]])!=0)
        sol++;
    g<<sol<<"\n";
    f.close();g.close();
    return 0;
}