#include <vector>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <map>


using namespace std;

int main()
{
int n;
while(cin >> n)
{
	vector<int> vystup;
	for(int i = 0; i< n; i++)
	{	

		bool vis[10];
		for(int j = 0; j<10; j++)
			vis[j] = false;
		string temp; int name= 0; 
		cin >> temp;

		for(int j = 0; j < temp.size(); j++)
		{
			vis[temp[j]-'0'] = true;	

		}
		for(int j = 0; j< 10; j++)
			if(vis[j])
			{
				name *= 10;
				name += j;
			}
		int j =0;
		while(j < vystup.size())
		{
			if(vystup[j] == name)
				break;
			j++;
		}
		if(j == (int)vystup.size())
			vystup.push_back(name);
			  
	}
	printf("%d\n", vystup.size());
}
return 0;
}