#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>

#define LL long long

using namespace std;

int N,R[36005];
string K[36005];

int comp(int i,int j){
    return K[i].compare(K[j]);
    }

int main(void){

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

in >> N;

string S;
char A[36005];

for (int i =0;i<N;i++){
    in >> S;
    strcpy(A, S.c_str());
    sort(A,A+S.length());
    K[i].assign(A);    
    }    

for (int i=0;i<N;i++)
    R[i] = i;

sort(R,R+N,comp);

int sol = 0;

if (! (K[0] == K[1])) sol ++;
if (!(K[N-2] == K[N-1]) && N!=2) sol ++;
for (int i=1;i<N-1;i++)
    if (!( K[i-1] == K[i] || K[i] == K[i+1])) sol ++;

out << sol;

in.close();
out.close();

return 0;

}