#include <fstream>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n,i,j;
char a[36001][17],AUX[21];
char s[21];
int p[36001];

int cmp(int i, int j) {
    return strcmp(a[i], a[j]) < 0;
}

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

    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>a[i];
        sort(a[i], a[i] + strlen(a[i]));
    }

    for (i=1;i<=n;i++) {
        p[i]=i;
    }

    sort(p+1, p+n+1, cmp);
    int sol = 0;
    if (strcmp( a[ p[1] ], a[ p[2] ] ) != 0) {
        sol++;
    }

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


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

    fout<<sol;
/**
    for (i=1;i<=n;i++)
        cout<<a[i]<<"\n";
    cout<<"\n";
    for (i=1;i<=n;i++)
        cout<<a[ p[i] ]<<"\n";
**/
    return 0;
}