#include <fstream>
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

ifstream fin ("restante.in");
ofstream fout("restante.out");

char v[40000][18];
int n, i, sol, p[40010];
int cmp(int a, int b) {
    return strcmp(v[a], v[b]) < 0;
}

int main(){
    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>v[i];
        sort(v[i], v[i]+strlen(v[i]));

        //cout<<v[i]<<"\n";

        p[i] = i;
    }
    sort(p+1, p+n+1, cmp);

    if (strcmp(v[ p[1] ], v[ p[2] ]) != 0) {
        sol++;
    }
    if (strcmp(v[ p[n-1] ], v[ p[n] ]) != 0) {
        sol++;
    }

    for (i=2;i<n;i++)
        if (strcmp(v[ p[i] ], v[ p[i-1] ]) != 0 && strcmp(v[ p[i] ], v[ p[i+1] ]) != 0)
            sol++;

    fout<<sol;

    return 0;
}