#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const int N=10010;
int main()
{
	int n;
	priority_queue<string,vector<string>,greater<string> > q;
	cin>>n;
	if(n==0) 
	{
		cout<<0<<endl;
		return 0;
	}
	for(int i=0;i<n;i++)
	{
		string a;
		cin>>a;  
		sort(a.begin(),a.end());
		q.push(a);  
	}
	int sum=1;
	while(q.size())
	{
		string t=q.top();
		q.pop();
		if(t!=q.top()) sum++;
	}
	cout<<sum<<endl;
	return 0;
}