#include <fstream>
#include <algorithm>
#include <string>

using namespace std;

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

const int NMAX = 36005;

string vec[NMAX];
int ans;

int main()
{
    int n;
    fin >> n;
    for (int i = 0; i < n; ++ i)
        {
         fin >> vec[i];
         sort(vec[i].begin(), vec[i].end());
        }
    fin.close();
    sort(vec, vec + n);
    if (vec[0] != vec[1])
        ++ ans;
    for (int i = 1; i < n; ++ i)
        if (vec[i] != vec[i - 1] && vec[i] != vec[i + 1])
            ++ ans;
    fout << ans << "\n";
    fout.close();
    return 0;
}