#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;

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

const int MAX_N = 36100;
const int MAX_L = 17;
const int MAX_A = 27;

int n;
string a[MAX_N];

int count[MAX_A];


int main() {
	fin >> n;
	for (int i = 1; i <= n; ++i) {
		fin >> a[i];
		sort(a[i].begin(), a[i].end());
	}
	sort(a + 1, a + n + 1);
	
	int soln = 0;
	for (int i = 1; i <= n; ) {
		int j = i;
		while (a[i] == a[j])
			++j;
		if (j == i + 1) ++soln;
		i = j;
	}
	
	fout << soln << '\n';
	
	fin.close();
	fout.close();
}