#include <iostream>
#include <algorithm>
#include <fstream>
#include <map>
#define MAX 36002
using namespace std;
int n,ans;
string s,v[MAX];
map<string, int> m;

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

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> s;
        sort(s.begin(), s.end());
        v[i] = s;
        m[s]++;
    }
    for(int i = 1; i <= n; i++){
        if(m[v[i]] == 1){
            ans++;
        }
    }
    fout << ans;
    return 0;
}