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

string a[36010];
char s[20];
int N;

int main () 
{
    int i, j, nr = 0;

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

    scanf ("%d\n", &N);

    for (i = 1; i <= N; ++ i) 
	{
        gets(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);

    for (i = 1; i <= N; ++ i)
        if ((i == 1 || a[i - 1] != a[i]) && (i == N || a[i + 1] != a[i]))
            ++ nr;

    printf("%d\n", nr);
	
	return 0l
}