#include<fstream>
#include<cstring>
#include<algorithm>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
int N,n,nr,k,s1,i,j,s2,k1,k2;
char v[20];
pair <int,int> p[36010];
int main(){
    fin>>N;
    for(i=1;i<=N;i++){
        fin>>v;
        n=strlen(v);
        sort(v,v+n);
        s1=0;
        s2=0;
        for(j=0;j<n;j++){
            if(j==0){
                k1=1;
                k2=1;
            }
            else{
                k1=(k1*26)%100009;
                k2=(k2*26)%666013;
            }
            s1=(s1+v[j]*k1)%100009;
            s2=(s2+v[j]*k2)%666013;
        }
        p[i].first=s1;
        p[i].second=s2;
    }
    sort(p+1,p+N+1);
    for(i=2;i<=N;i++){
        if(p[i].first!=p[i-1].first)
            nr++;
        else{
            if(p[i].second!=p[i-1].second)
                nr++;
        }
    }
    fout<<nr;
    return 0;
}