#include<fstream>
#include<cstring>
#include<algorithm>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
long long n, k, v[36005], sol, x[36005];
char s[20];
int main(){
    fin >> n;
    for( long long i = 1; i <= n; i++ ){
        fin >> s;
        k = strlen(s);
        sort( s, s + k );
        for( long long j = 0; j < k; j++ ){
            v[i] = v[i] * 10 + (long long)( s[j] - 'a' + 1 );
        }
    }
    sort( v + 1, v + n + 1 );
    k = 1;
    for( int i = 2; i <= n; i++ ){
        if( v[k] != v[i] ){
            v[++k] = v[i];
        }else{
            x[k]++;
        }
    }
    sol = 0;
    for( int i = 1; i <= k; i++ ){
        if( x[i] == 1 ){
            sol++;
        }
    }
    fout << sol;
    return 0;
}