#include <iostream>
#include <fstream>
#include <map>
#include <algorithm>
#include <string>

using namespace std;

#define N 36001

ifstream inFile;
ofstream outFile;
map<string, int> words; // red black tree
int n;

int main() {
	inFile.open("restante.in",ios::in);
	outFile.open("restante.out",ios::out);

	if (inFile.is_open() == 0) {
		cerr<<"Unable to open file for input.";
		exit(1);
	}

	if (outFile.is_open() == 0) {
		cerr<<"Unable to open file for output.";
		exit(1);
	}

	inFile>>n;

	for (int i=1; i<=n; i++) {
		string str;
		inFile>>str;
		sort(str.begin(), str.end());
		words[str]++;
	}
	
	int nr=0;
	for(map<string, int>::iterator ii=words.begin(); ii!=words.end(); ++ii) {	
		if (ii->second == 1)
			nr++;
	}

	outFile<<nr;
	inFile.close();
	outFile.close();
	words.clear();

	return 0;
}