#include <algorithm>
#include <fstream>
#include <cstring>

using namespace std;

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

const int nmax= 36000;

string s[nmax+1];

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

    int sol= 0, p= 0;
    for ( int i= 0; i<n; i=p ) {
        p= i+1;
        while ( s[i]==s[p] ) {
            ++p;
        }
        if ( p==i+1 ) {
            ++sol;
        }
    }

    fout<<sol<<"\n";

    return 0;
}