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

using namespace std;

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

char a[36005][20], aux[20];
int n, v[20], cont, sol;

int main()
{
    fin>>n;
    for(int i = 1; i <= n; i++){
        fin>>a[i];
        cont = 0;
        for(int j = 0; a[i][j] != 0; j++){
            v[j] = (int)a[i][j];
            cont++;
        }
        sort(v, v + cont);
        for(int j = 0; j < cont; j++){
            a[i][j] = (char)v[j];
        }
    }
    for(int i = 1; i < n; i++){
        for(int j = i + 1; j <= n; j++){
            if (strcmp(a[i], a[j]) > 0) {
                strcpy(aux, a[i]);
                strcpy(a[i], a[j]);
                strcpy(a[j], aux);
            }
        }
    }
    for(int i = 1; i < n; i++){
        for(int j = 0; a[i][j] != 0; j++){
            if(a[i][j] != a[i + 1][j]){
                sol++;
                break;
            }
        }
    }
    fout<<sol;
    return 0;
}