#include <string>
#include <cstdio>
#include <map>
#include <algorithm>
#include <iostream>
#include <tr1/unordered_map>

using namespace std;
using namespace tr1;

#define maxn 36101

string t[maxn];
unordered_map <string, int> m;
int n, sol;

int main()
{
    int i;
    freopen ("restante.in", "r", stdin);
    freopen ("restante.out", "w", stdout);
    scanf("%d", &n);
    for(i = 1; i <= n; ++i) {
        cin >> t[i];
        sort(t[i].begin(), t[i].end());
        m[t[i]]++;
    }
    for(i = 1; i <= n; ++i) {
        if(m[t[i]] == 1)
            sol++;
    }
    cout << sol;
    return 0;
}