#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
ifstream si("restante.in");
ofstream so("restante.out");
string v[36005];
int main()
{
    int n;
    si>>n;
    for(int i=1;i<=n;++i)
    {
        si>>v[i];
        sort(v[i].begin(),v[i].end());
    }
    sort(v+1,v+n+1);
    int c=0;
    for(int i=1;i<=n;++i)
    {
        if(v[i]!=v[i-1]&&v[i]!=v[i+1])
            ++c;
    }
    so<<c<<'\n';
    return 0;
}