#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;

ifstream f("restante.in");
ofstream g("restante.out");
vector<string>v;
int n,i,x,j,idem;
string s;
void nxn(int st,int dr){
	int i,j;
	for(i=st;i<dr;++i)
		for(j=i+1;j<=dr;++j)
			if(s[i]-'0'>s[j]-'0')
				swap(s[i],s[j]);
}
int  main (){
	f>>n;
	for(i=1;i<=n;i++){
		f>>s;
		x=s.length();
		nxn(0,x-1);
		v.push_back(s);
	}
	sort(v.begin(),v.end());
	if(v[0]!=v[1])
		++idem;
	for(i=1;i<n-1;++i){
		if(v[i]!=v[i-1] && v[i]!=v[i+1] )
			++idem;
	}
	if(v[n-1]!=v[n-2])
		++idem;
	g<<idem<<"\n";
	return 0;
}