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

using namespace std;

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

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

int main()
{
    fin>>n;
    for(int i = 1; i <= n; i++){
        fin>>c[i];
    }
    for(int i = 1; i <= n; i++){
        cont = 0;
        for(int j = 0; c[i][j] != 0; j++){
            v[i][j + 1] = (int)c[i][j];
            cont++;
        }
        v[i][0] = cont;
        sort(v[i] + 1, v[i] + cont + 1);
    }
    for(int k = 1; k <= n; k++){
        for (int i = 1; i < v[k][0]; i++){
            for (int j = i + 1; j <= v[k][0]; j++){
                if (v[k][i] > v[k][j]){
                    swap(v[k][i], v[k][j]);
                }
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= v[i][0]; j++){
            if(v[i][j] != v[i + 1][j]){
                sol++;
                break;
            }
        }
    }
    fout<<sol;
    return 0;
}