#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <map>
#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;
map<string, int>mset;
int N, sol;

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