#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <set>
#include <string.h>

using namespace std;

ifstream cin("restante.in");
ofstream cout("restante.out");

const int MAXN = 36005;
const int oo = (1<<31)-1;

string c;
vector<string>mset;
int N, sol;

int main()
{
    cin >> N;
    for(int i = 1 ; i <= N ; ++ i){
        cin >> c;
        sort(c.begin(), c.end());
        mset.push_back(c);
    }
    sort(mset.begin(), mset.end());
    mset.push_back(" ");
    for(int i = 1 ; i < N ; ++ i)
        if(mset[i] != mset[i-1] && mset[i] != mset[i+1])
            ++sol;
    cout << sol << "\n";
    cin.close();
    cout.close();
    return 0;
}