#include <cstring>
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;

#define MAXN 36010

ifstream f("restante.in");
ofstream g("restante.out");

int n;
string a[MAXN];
int solutie;

int main()
{
    f >> n;
    f.get();
    for (int i = 1; i <= n; i++) {
        getline(f, a[i]);
        sort(a[i].begin(), a[i].end());
    }

    sort(a + 1, a + n + 1);

    if (a[1] != a[2]) {
        solutie++;
    }

    if (a[n] != a[n - 1]) {
        solutie++;
    }

    for (int i = 2; i < n; i++) {
        if (a[i] != a[i - 1] && a[i] != a[i + 1]) {
            solutie++;
        }
    }

    g << solutie;

    return 0;
}