#include <bits/stdc++.h>

using namespace std;

ifstream fin("restante.in");
ofstream fout("restante.out");

const int MAXN = 36e3;
int n, cate, dim;
vector < string > v[MAXN];
string x;

int main()
{

    fin>>n;
    int m = n;
    while(n--)
    {
        fin>>x;
        sort(x.begin(),x.end());
        v[++dim].push_back(x);
    }

    sort(v+1,v+dim+1);

    for(int i=1; i<dim; i++)
    {
        if(v[i][0] != v[i+1][0]) cate++;
    }

    if(m == 1 && !cate) cate++;

    fout<<cate;


}