#include <stdio.h>
#include <algorithm>
#include <string>
using namespace std;

#define NMAX 36010

int N;

char s[30];

string a[NMAX];

int main()
{
	int i, j;

	freopen("restante.in", "r", stdin);
	freopen("restante.out", "w", stdout);

	scanf("%d", &N);

	for (i = 1; i <= N; i++) {
		scanf("%s", s);

		for (j = 0; s[j]; j++) a[i].push_back(s[j]);
		sort(a[i].begin(), a[i].end());
	}

	sort(a + 1, a + N + 1);

	int rez = 0;
	for (i = 1; i <= N; ) {
		for (j = i; j <= N && a[i] == a[j]; j++);

		rez += j - i == 1;

		i = j;
	}

	printf("%d\n", rez);

return 0;
}