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

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

char ch[36100][18];
int a[36100], i, n, s;
int cmp(int x, int y){
    return strcmp(ch[x], ch[y]) < 0 ;
    }
int main()
{
    fin >> n;
    for(i = 1; i <= n; i ++){
        fin >> ch[i];
        sort(ch[i], ch[i]+strlen(ch[i]));
        a[i] = i;
    }
    sort(a + 1, a + n + 1, cmp);
    for(i = 1; i <= n; i ++){
        if( strcmp(ch[a[i - 1]], ch[a[i]]) != 0 && strcmp(ch[a[i]], ch[a[i+1]]) != 0)
            s ++;
    }
    fout << s;
    return 0;
}