#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define ld long double

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

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

const int NMAX = 36000;

int n, answer;
string a[NMAX + 1];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    fin >> n;
    for(int i = 1; i <= n; i++) {
        string s;
        fin >> s;
        sort(s.begin(), s.end());
        a[i] = s;
    }

    sort(a + 1, a + n + 1);
    answer += (a[1] != a[2]);
    answer += (a[n] != a[n - 1]);
    for(int i = 2; i < n; i++) {
        answer += (a[i] != a[i - 1] && a[i] != a[i + 1]);
    }
    fout << answer << '\n';
    return 0;
}