#include <stdio.h>
#include <algorithm>
#include <set>
#include <vector>
#include <string>
#include <map>
using namespace std;

#define in "restante.in"
#define out "restante.out"

int N;
string A;
map<string,int> K;
vector<string> S;
set<string> P;

int main()
{
    char linie[19];
    FILE *fin = fopen(in,"r");
    freopen(out,"w",stdout);
    
    fscanf(fin,"%d\n", &N);
    for ( int i = 1; i <= N; i++ )
    {
        int j = 0;
        A = "";
        fgets(linie,18,fin);
        
        while ( linie[j] >= 'a' && linie[j] <= 'z' ) A += linie[j], ++j;
        
        sort(A.begin(),A.end());
        
        S.push_back(A);
    } 
    
    int T = 0;
    
    for ( int i = 0; i < S.size(); i++ )
        K[S[i]] += 1;
    
    for ( int i = 0; i < S.size(); i++ )
        if ( K[S[i]] == 1 ) T += 1; 
    
    printf("%d", T);
    
}