using namespace std;
#include <cstdio>
#include <algorithm>
#include <string>
#include <map>
#define maxn 36001

string a[maxn];
map<string, int>H;
int n;

void read()
{
	freopen("restante.in","r",stdin);
	char x[32];
	int i;
	scanf("%d\n", &n);
	for(i=1;i<=n;++i)
	{
		gets(x);
		a[i]+=x;
	}
}

void solve()
{
	int i, j;
	
	for(i=1;i<=n;++i)
		sort(a[i].begin(), a[i].end());
	
	for(i=1;i<=n;++i) ++H[a[i]];
	int nr=0;
	for(i=1;i<=n;++i) if(H[a[i]]==1) ++nr;
	printf("%d\n", nr);
}

int main()
{
	freopen("restante.out","w",stdout);
	read();
	solve();
	
	return 0;
}