#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <set>

#define map unordered_map
//#define set unordered_set

using namespace std;

int main(int argc, char **argv) {

	int rowC;

	while (cin >> rowC) {
		string row;
		unordered_set<string> found;
		for (int i=0; i<rowC; ++i) {
			set<char> uniq;
			cin >> row;
			for (string::size_type j = 0; j < row.length(); ++j) {
				uniq.insert(row[j]);
			}
			string us;
			for (auto c: uniq) {
				us.append(1,c);
			}
			found.insert(us);
		}
		printf("%lu\n", found.size());
	}

	return 0;
}