#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n;
char s[36001][17];
void solve(){
    int i,j,m,k=0;
    char aux[17];
    scanf("%d",&n);
    for(i=1; i<=n; ++i){
        scanf("%s",&s[i]);
        m=strlen(s[i]);
        sort(s[i],s[i]+m);}
    for(i=1; i<n; ++i)
        for(j=i+1; j<=n; ++j)
            if(strcmp(s[i],s[j])>0){
                strcpy(aux,s[i]);
                strcpy(s[i],s[j]);
                strcpy(s[j],aux);}
    for(i=1; i<=n; ++i)
        if(strcmp(s[i],s[i+1]))
            ++k;
        else
            while(!strcmp(s[i],s[i+1]))
                ++i;
    printf("%d",k);}
int main(){
    freopen("restante.in","r",stdin);
    freopen("restante.out","w",stdout);
    solve();
    return 0;}